Approximating the $\tau $-relaxed soft capacitated facility location problem
- 1 August 2020
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 40 (3) , 848-860
Abstract
No abstract availableKeywords
Funding Information
- Natural Science Foundation of China (11531014, 11871081)
- Natural Science Foundation of China (11901558)
- China Postdoctoral Science Foundation funded project (2018M643233)
- Natural Science Foundation of China (11871081)
This publication has 27 references indexed in Scilit:
- Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual AlgorithmsSIAM Journal on Computing, 2019
- An Improved Approximation for k -Median and Positive Correlation in Budgeted OptimizationACM Transactions on Algorithms, 2017
- Improved Approximation Algorithm for k-level Uncapacitated Facility Location Problem (with Penalties)Theory of Computing Systems, 2014
- A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problemsMathematical Programming, 2014
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location ProblemSIAM Journal on Computing, 2010
- Local Search Heuristics for k-Median and Facility Location ProblemsSIAM Journal on Computing, 2004
- Improved Approximation Algorithms for the Uncapacitated Facility Location ProblemSIAM Journal on Computing, 2003
- A Constant-Factor Approximation Algorithm for the k-Median ProblemJournal of Computer and System Sciences, 2002
- A 3-approximation algorithm for the -level uncapacitated facility location problemInformation Processing Letters, 1999
- Greedy Strikes Back: Improved Facility Location AlgorithmsJournal of Algorithms, 1999