Approximate the lower-bounded connected facility location problem
From MaRDI portal
Publication:2695316
DOI10.1007/978-3-030-89543-3_41OpenAlexW3208393448MaRDI QIDQ2695316
Lu Han, Yicheng Xu, Chen-Chen Wu
Publication date: 30 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-89543-3_41
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- Approximating the \(\tau\)-relaxed soft capacitated facility location problem
- \(\mathrm{M}^p\)UFLP: universal facility location problem in the \(p\)-th power of metric space
- Improved approximation algorithm for universal facility location problem with linear penalties
- Improved Approximation Guarantees for Lower-Bounded Facility Location
- Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Local Search Heuristics for k-Median and Facility Location Problems
- Provisioning a virtual private network
- On Facility Location with General Lower Bounds
This page was built for publication: Approximate the lower-bounded connected facility location problem
