Pages that link to "Item:Q2768299"
From MaRDI portal
The following pages link to A deterministic algorithm for the cost-distance problem (Q2768299):
Displaying 12 items.
- An explicit bound on the transportation cost distance (Q380692) (← links)
- Improved approximation algorithms for directed Steiner forest (Q414883) (← links)
- LP-based approximation algorithms for facility location in buy-at-bulk network design (Q666665) (← links)
- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees (Q1017907) (← links)
- Online covering with \(\ell_q\)-norm objectives and applications to network design (Q2205975) (← links)
- Minimizing the sum of distances to a server in a constraint network (Q2330034) (← links)
- A Deterministic Reduction for the Gap Minimum Distance Problem (Q2989711) (← links)
- LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design (Q3449835) (← links)
- Online Buy-at-Bulk Network Design (Q4577806) (← links)
- An efficient algorithm for computing free distance (Corresp.) (Q5641068) (← links)
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)
- On the complexity of the cable-trench problem (Q6048437) (← links)