The Facility Location Problem with General Cost Functions

Networks

Volumn 42, Issue 1, 2003, Pages 42-47

  Hajiaghayi, M T ^a,b   Mahdian, M ^a   Mirrokni, V S ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation algorithms; Concave facility location; Facility location problem; Generalized facility location

Indexed keywords

CONCAVE FACILITY LOCATION; COST FUNCTIONS; FACILITY LOCATION PROBLEMS; GENERALIZED FACILITY LOCATION; GREEDY ALGORITHMS;

ALGORITHMS; APPROXIMATION THEORY; LINEAR PROGRAMMING; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

OPERATIONS RESEARCH;

EID: 2142843532     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10080     Document Type: Article

References (27)

1. V. Arya, N. Garg, R. Khandekar, K. Munagala, and V. Pandit, Local search heuristics for k-median and facility location problems, Proc 33rd ACM Symp on Theory of Computing, 2001, pp. 21-29.
2. M. Charikar and S. Guha, Improved combinatorial algorithms for facility location and k-median problems, Proc 40th IEEE Symp on Foundations of Computer Science, 1999, pp. 378-388.
3. F.A. Chudak, "Improved approximation algorithms for uncapacited facility location," Integer programming and combinatorial optimization, Vol. 1412, Lecture Notes in Computer Science, R.E. Bixby, E.A. Boyd, and R.Z. Ríos-Mercado (Editors), Springer, Berlin, 1998, pp. 180-194.
4. F.A. Chudak and D. Shmoys, Improved approximation algorithms for the uncapacitated facility location problem, unpublished manuscript, 1998.
5. F.A. Chudak and D. Shmoys, Improved approximation algorithms for the capacitated facility location problem, Proc 10th ACM-SIAM Symp on Discrete Algorithms, 1999, pp. 875-876.
6. F.A. Chudak and D.P. Williamson, "Improved approximation algorithms for capacitated facility location problems," Integer programming and combinatorial optimization, Vol. 1610, Lecture Notes in Computer Science, Springer, Berlin, 1999, pp. 99-113.
7. V. Chvátal, A greedy heuristic for the set-covering problem, Math Oper Res 4 (1979), 233-235.
8. M. Goemans and J. Kleinberg, An improved approximation ratio for the minimum latency problem, Math Program 82 (1998), 111-124.
9. S. Guha and S. Khuller, Greedy strikes back: Improved facility location algorithms, J Algorithms 31 (1999), 228-248.
10. S. Guha, A. Meyerson, and K. Munagala, Hierarchical placement and network design problems, Proc 41st IEEE Symp on Foundations of Computer Science, 2000, pp. 603-612.
11. K. Jain, M. Mahdian, E. Markakis, A. Saberi, and V.V. Vazirani, Approximation algorithms for facility location via dual fitting with factor-revealing LP, J ACM (to appear).
12. K. Jain, M. Mahdian, and A. Saberi, A new greedy approach for facility location problem, Proc 34rd ACM Symp on Theory of Computing, 2002, pp. 731-740.
13. K. Jain and V.V. Vazirani, Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation, J ACM 48 (2001), 274-296.
14. D.R. Karger and M. Minkoff, Building Steiner trees with incomplete global knowledge, Proc 41st IEEE Symp on Foundations of Computer Science, 2000, pp. 613-623.
15. M.R. Korupolu, C.G. Plaxton, and R. Rajaraman, Analysis of a local search heuristic for facility location problems, J Algorithms 37 (2000), 146-188.
16. A.A. Kuehn and M.J. Hamburger, A heuristic program for locating warehouses, Manag Sci 9 (1963), 643-666.
17. T. Leighton, Internet research seminars at MIT, February 2002.
18. J.H. Lin and J.S. Vitter, ε-Approximations with minimum packing constraint violation, Proc 24th ACM Symp on Theory of Computing, 1992, pp. 771-782.
19. M. Mahdian, E. Markakis, A. Saberi, and V.V. Vazirani, A greedy facility location algorithm analyzed using dual fitting, Proc 5th Int Workshop on Randomization and Approximation Techniques in Computer Science, Vol. 2129, Lecture Notes in Computer Science, Springer, Berlin, 2001, pp. 127-137.
20. M. Mahdian, Y. Ye, and J. Zhang, Improved approximation algorithms for metric facility location problems, 5th Int Workshop on Approximation Algorithms for Combinatorial Optimization, 2002, pp. 229-242.
21. R.J. McEliece, E.R. Rodemich, H. Rumsey, Jr., and L.R. Welch, New upper bounds on the rate of a code via the Delsarte-Macwilliams inequalities, IEEE Trans Inform Theory 23 (1977), 157-166.
22. M. Pal, E. Tardos, and T. Wexler, Facility location with hard capacities, Proc 42nd IEEE Symp on Foundations of Computer Science, 2001, pp. 329-338.
23. D.B. Shmoys, "Approximation algorithms for facility location problems," Approximation algorithms for combinatorial optimization, Vol. 1913, Lecture Notes in Computer Science, K. Jansen and S. Khuller (Editors), Springer, Berlin 2000, pp. 27-33.
24. D.B. Shmoys, E. Tardos, and K.I. Aardal, Approximation algorithms for facility location problems, Proc 29th ACM Symp on Theory of Computing, 1997, pp. 265-274.
25. M. Sviridenko, An 1.582-approximation algorithm for the metric uncapacitated facility location problem, Ninth Conf on Integer Programming and Combinatorial Optimization, 2002, pp. 240-257.
26. D.B. West, Introduction to graph theory, Prentice-Hall, Upper Saddle River, NJ, 1996.
27. J. Zhang, personal communication.