Improved Approximation Algorithm for Connected Facility Location Problems
From MaRDI portal
Recommendations
- Approximation algorithms for connected facility location problems
- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
- Primal-dual algorithms for connected facility location problems
- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
- scientific article; zbMATH DE number 1947062
Cited in
(13)- An efficient approximation algorithm for the extension facility location problem on torus internetwork topology
- The connected facility location polytope
- Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
- Securely connected facility location in metric graphs
- Improved algorithms for joint optimization of facility locations and network connections
- scientific article; zbMATH DE number 1947062 (Why is no real title available?)
- Primal-dual algorithms for connected facility location problems
- 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
- Approximation algorithms for connected facility location problems
This page was built for publication: Improved Approximation Algorithm for Connected Facility Location Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611984)