Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
- 1 January 2003
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 33 (1) , 1-25
- https://doi.org/10.1137/s0097539703405754
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxationJournal of the ACM, 2001
- Analysis of a Local Search Heuristic for Facility Location ProblemsJournal of Algorithms, 2000
- Greedy Strikes Back: Improved Facility Location AlgorithmsJournal of Algorithms, 1999
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problemsJournal of the ACM, 1998
- A threshold of ln n for approximating set coverJournal of the ACM, 1998
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability ProblemSIAM Journal on Discrete Mathematics, 1994
- Heuristics for the fixed cost median problemMathematical Programming, 1982
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate AlgorithmsManagement Science, 1977
- On a combinatorial gameJournal of Combinatorial Theory, Series A, 1973
- Integer Programming: Methods, Uses, ComputationsManagement Science, 1965