Approximation algorithms for connected facility location problems
From MaRDI portal
Recommendations
- Improved Approximation Algorithm for Connected Facility Location Problems
- Primal-dual algorithms for connected facility location problems
- scientific article; zbMATH DE number 1947062
- Approximating connected facility location with lower and upper bounds via LP rounding
- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
Cites work
- scientific article; zbMATH DE number 1303535 (Why is no real title available?)
- scientific article; zbMATH DE number 1303608 (Why is no real title available?)
- scientific article; zbMATH DE number 1947060 (Why is no real title available?)
- scientific article; zbMATH DE number 1947062 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- scientific article; zbMATH DE number 1445376 (Why is no real title available?)
- A General Approximation Technique for Constrained Forest Problems
- Algorithm Theory - SWAT 2004
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Improved Approximation for Single-Sink Buy-at-Bulk
- Primal-dual algorithms for connected facility location problems
- Provisioning a virtual private network: a network design problem for multicommodity flow
- Simpler and better approximation algorithms for network design
Cited in
(24)- Construction Line Algorithms for the Connection Location-Allocation Problem
- An efficient approximation algorithm for the extension facility location problem on torus internetwork topology
- Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (extended abstract)
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
- The connected facility location polytope
- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
- A randomized \(O(\log n)\)-competitive algorithm for the online connected facility location problem
- 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
- Approximating minimum cost source location problems with local vertex-connectivity demands
- Improved algorithms for joint optimization of facility locations and network connections
- scientific article; zbMATH DE number 1947062 (Why is no real title available?)
- Improved Approximation Algorithm for Connected Facility Location Problems
- Primal-dual algorithms for connected facility location problems
- Branch-and-cut-and-price for capacitated connected facility location
- Connected facility location via random facility sampling and core detouring
- A PTAS for the geometric connected facility location problem
- Approximate the lower-bounded connected facility location problem
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
- Approximating connected facility location with lower and upper bounds via LP rounding
- Approximation algorithms for facility location with capacitated and length-bounded tree connections
- On the Asymmetric Connected Facility Location Polytope
This page was built for publication: Approximation algorithms for connected facility location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1016041)
