Approximate the lower-bounded connected facility location problem
From MaRDI portal
Recommendations
- Approximating connected facility location with lower and upper bounds via LP rounding
- Approximation algorithms for connected facility location problems
- Improved Approximation Algorithm for Connected Facility Location Problems
- Approximation algorithms for bounded facility location problems
- Improved approximation guarantees for lower-bounded facility location
- An approximation framework for bounded facility location problems
- scientific article; zbMATH DE number 1670526
- Approximation algorithms for facility location with capacitated and length-bounded tree connections
- Approximate robust optimization for the connected facility location problem
- scientific article; zbMATH DE number 1559542
Cites work
- scientific article; zbMATH DE number 5764866 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- scientific article; zbMATH DE number 2086926 (Why is no real title available?)
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- A 6.55 factor primal-dual approximation algorithm for the connected facility location problem
- Approximating the \(\tau\)-relaxed soft capacitated facility location problem
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
- Approximation algorithms for connected facility location problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Improved approximation algorithm for universal facility location problem with linear penalties
- Improved approximation guarantees for lower-bounded facility location
- Local Search Heuristics for k-Median and Facility Location Problems
- Lower-bounded facility location
- On facility location with general lower bounds
- Primal-dual algorithms for connected facility location problems
- Provisioning a virtual private network: a network design problem for multicommodity flow
- \(\mathrm{M}^p\)UFLP: universal facility location problem in the \(p\)-th power of metric space
Cited in
(8)- Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands
- Approximating minimum cost source location problems with local vertex-connectivity demands
- scientific article; zbMATH DE number 1947062 (Why is no real title available?)
- Primal-dual algorithms for connected facility location problems
- An approximation framework for bounded facility location problems
- A polynomial-time exact algorithm for the connected k-facility location problem on trees
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
- On the Asymmetric Connected Facility Location Polytope
This page was built for publication: Approximate the lower-bounded connected facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695316)
