Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
From MaRDI portal
Recommendations
- Approximation algorithms for multicommodity facility location problems
- Approximation algorithms for connected facility location problems
- Combinatorial approximation algorithms for buy-at-bulk connected facility location problems
- scientific article; zbMATH DE number 1670526
- Approximation Algorithms for Problems Combining Facility Location and Network Design
- Improved Approximation Algorithm for Connected Facility Location Problems
- scientific article; zbMATH DE number 1559542
- Approximate algorithms for the competitive facility location problem
- Approximation algorithms for bounded facility location problems
- Approximate the lower-bounded connected facility location problem
Cites work
- scientific article; zbMATH DE number 1757956 (Why is no real title available?)
- scientific article; zbMATH DE number 2086941 (Why is no real title available?)
- A constant factor approximation for the single sink edge installation problem
- A constant-factor approximation for stochastic Steiner forest
- A threshold of ln n for approximating set cover
- A tight bound on approximating arbitrary metrics by tree metrics
- Algorithm Theory - SWAT 2004
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
- An improved LP-based approximation for Steiner tree
- An improved approximation algorithm for uncapacitated facility location problem with penalties
- An improved approximation algorithm for virtual private network design
- Approximation via cost sharing
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Connected facility location via random facility sampling and core detouring
- Cost-Distance: Two Metric Network Design
- Greedy Strikes Back: Improved Facility Location Algorithms
- Improved Approximation for Single-Sink Buy-at-Bulk
- Network design via core detouring for problems without a core
- New Approaches for Virtual Private Network Design
- On the Complexity of the Asymmetric VPN Problem
- Primal-dual algorithms for connected facility location problems
- Provisioning a virtual private network: a network design problem for multicommodity flow
- Sharing the cost more efficiently, improved approximation for multicommodity rent-or-buy
- Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree
- The Steiner tree problem on graphs: inapproximability results
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
Cited in
(16)- Combinatorial approximation algorithms for the robust facility location problem with penalties
- The connected facility location polytope
- The online multicommodity connected facility location problem
- Securely connected facility location in metric graphs
- Combinatorial approximation algorithms for buy-at-bulk connected facility location problems
- Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems
- scientific article; zbMATH DE number 1947062 (Why is no real title available?)
- The online connected facility location problem
- Primal-dual algorithms for connected facility location problems
- Multicommodity facility location under group Steiner access cost
- Approximation algorithms for a combined facility location buy-at-bulk network design problem
- A polynomial-time exact algorithm for the connected k-facility location problem on trees
- Approximate the lower-bounded connected facility location problem
- An algorithmic framework for the exact solution of tree-star problems
- LP-based approximation algorithms for facility location in buy-at-bulk network design
- LP-based approximation algorithms for facility location in buy-at-bulk network design
This page was built for publication: Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3009767)
