Simpler and better approximation algorithms for network design
From MaRDI portal
Recommendations
Cited in
(42)- Approximation algorithms for connected facility location problems
- Approximating buy-at-bulk and shallow-light \(k\)-Steiner trees
- Improved approximation algorithms for the single-sink buy-at-bulk network design problems
- A note on the subadditive network design problem
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
- Connected facility location via random facility sampling and core detouring
- A new approximation algorithm for the selective single-sink buy-at-bulk problem in network design
- Algorithms for the metric ring star problem with fixed edge-cost ratio
- Two-level hub Steiner trees
- A simpler and better derandomization of an approximation algorithm for single source rent-or-buy
- Cost-sharing mechanisms for network design
- An improved approximation algorithm for virtual private network design
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (extended abstract)
- Incremental network design with shortest paths
- Approximability of unsplittable shortest path routing problems
- scientific article; zbMATH DE number 1003253 (Why is no real title available?)
- Combinatorial approximation algorithms for buy-at-bulk connected facility location problems
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- Provisioning virtual private networks under traffic uncertainty
- Deterministic Sampling Algorithms for Network Design
- Approximation via cost sharing
- Network design via core detouring for problems without a core
- Hardness of robust network design
- Competitive and deterministic embeddings of virtual networks
- Online Buy-at-Bulk Network Design
- Exact approaches for designing multifacility buy-at-bulk networks
- Deterministic sampling algorithms for network design
- Black-box reductions for cost-sharing mechanism design
- Traffic-redundancy aware network design
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph
- An exact algorithm for the maximum leaf spanning tree problem
- A polynomial-time exact algorithm for the connected k-facility location problem on trees
- Improved guarantees for the a priori TSP
- Approximation algorithms for access network design
- Cross-monotonic cost sharing methods for connected facility location games
- Approximation algorithms for hop constrained and buy-at-bulk network design via hop constrained oblivious routing
- On the connected minimum sum of radii problem
- Directed buy-at-bulk spanners
- On the parameterized complexity of reconfiguration of connected dominating sets
- Design of trees in the hose model: the balanced case
- Solving connected dominating set faster than \(2^n\)
This page was built for publication: Simpler and better approximation algorithms for network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581250)
