Connected facility location via random facility sampling and core detouring

Journal of Computer and System Sciences

Volumn 76, Issue 8, 2010, Pages 709-726

  Eisenbrand, Friedrich ^a   Grandoni, Fabrizio ^b   Rothvoß, Thomas ^a   Schäfer, Guido ^c  

^a EPFL   (Switzerland)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

^c CWI   (Netherlands)

Author keywords

Approximation algorithm; Connected facility location; Network design; Randomized algorithm

Indexed keywords

LOCATION;

ALGORITHMIC FRAMEWORK; APPROXIMATE SOLUTION; APPROXIMATION RATIOS; CONNECTED FACILITY LOCATION; FACILITY LOCATION PROBLEM; NETWORK DESIGN; NETWORK DESIGN PROBLEMS; RANDOMIZED ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 78751494808     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2010.02.001     Document Type: Article

References (42)

1. A. Agrawal, P. Klein, R. Ravi, When trees collide: an approximation algorithm for the generalized Steiner problem on networks, SIAM J. Comput. 24 (1995) 440-456.
2. M. Andrews, L. Zhang, The access network design problem, in: IEEE Symposium on Foundations of Computer Science (FOCS), 1998, pp. 40-49.
3. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and the hardness of approximation problems, J. ACM 45 (3) (1998) 501-555.
4. L. Becchetti, J. Könemann, S. Leonardi, M. Pál, Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy, in: ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005, pp. 375-384.
5. M. Bern, P. Plassmann, The Steiner problem with edge lengths 1 and 2, Inform. Process. Lett. 32 (4) (1989) 171-176.
6. N. Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem, technical report, Graduate School of Industrial Administration, Carnegie-Mellon University, 1976.
7. S.E. Dreyfus, R.A. Wagner, The Steiner problem in graphs, Networks 1 (1971/1972) 195-207.
8. F. Eisenbrand, F. Grandoni, An improved approximation algorithm for virtual private network design, in: ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005, pp. 928-932.
9. F. Eisenbrand, F. Grandoni, G. Oriolo, M. Skutella, New approaches for virtual private network design, in: International Colloquium on Automata, Languages and Programming (ICALP), 2005, pp. 1151-1162.
10. F. Eisenbrand, F. Grandoni, G. Oriolo, M. Skutella, New approaches for virtual private network design, SIAM J. Comput. 37 (3) (2007) 706-721.
11. F. Eisenbrand, F. Grandoni, T. Rothvoß, G. Schäfer, Approximating connected facility location problems via random facility sampling and core detouring, in: ACM-SIAM Symposium on Discrete Algorithms (SODA), 2008, pp. 1174-1183.
12. L. Fleischer, J. Könemann, S. Leonardi, G. Schäfer, Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree, in: ACM Symposium on the Theory of Computing (STOC), 2006, pp. 663-670.
13. M.R. Garey, D.S. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
14. M.X. Goemans, D.P. Williamson, A general approximation technique for constrained forest problems, SIAM J. Comput. 24 (1995) 296-317.
15. F. Grandoni, G.F. Italiano, Improved approximation for single-sink buy-at-bulk, in: International Symposium on Algorithms and Computation (ISAAC), 2006, pp. 111-120.
16. S. Guha, A. Meyerson, K. Munagala, A constant factor approximation for the single sink edge installation problem, in: ACM Symposium on the Theory of Computing (STOC), 2001, pp. 383-388.
17. A. Gupta, J. Kleinberg, A. Kumar, R. Rastogi, B. Yener, Provisioning a virtual private network: a network design problem for multicommodity flow, in: ACM Symposium on the Theory of Computing (STOC), 2001, pp. 389-398.
18. A. Gupta, A. Kumar, M. Pal, T. Roughgarden, Approximation via cost-sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem, in: IEEE Symposium on Foundations of Computer Science (FOCS), 2003, pp. 606-617.
19. A. Gupta, A. Kumar, M. Pal, T. Roughgarden, Approximation via cost-sharing: simpler and better approximation algorithms for network design, J. ACM 54 (3) (2007) 11.
20. A. Gupta, A. Kumar, T. Roughgarden, Simpler and better approximation algorithms for network design, in: ACM Symposium on the Theory of Computing (STOC), 2003, pp. 365-372.
21. A. Gupta, M. Pál, R. Ravi, A. Sinha, Boosted sampling: approximation algorithms for stochastic optimization, in: ACM Symposium on the Theory of Computing (STOC), 2004, pp. 417-426
22. A. Gupta, A. Srinivasan, E. Tardos, Cost-sharing mechanisms for network design, in: International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2004, pp. 139-150.
23. H. Jung, M.K. Hasan, K. Chwa, Improved primal-dual approximation algorithm for the connected facility location problem, in: Conference on Combinatorial Optimization and Applications (COCOA), 2008, pp. 265-277.
24. M. Held, R.M. Karp, A dynamic programming approach to sequencing problems, J. SIAM 10 (1962) 196-210.
25. K. Jain, M. Mahdian, E. Markakis, A. Saberi, V. Vazirani, Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP, J. ACM 50 (2003) 795-824.
26. K. Jain, V. Vazirani, Approximation algorithms for metric facility location and k-median problems using the primal-dual scheme and Lagrangian relaxation, J. ACM 48 (2001) 274-296.
27. R. Jothi, B. Raghavachari, Improved approximation algorithms for the single-sink buy-at-bulk network design problems, in: Scandinavian Workshop on Algorithm Theory (SWAT), 2004, pp. 336-348.
28. D.R. Karger, M. Minkoff, Building Steiner trees with incomplete global knowledge, in: IEEE Symposium on Foundations of Computer Science (FOCS), 2000, pp. 613-623.
29. M. Mahdian, Y. Ye, J. Zhang, Improved approximation algorithms for metric facility location problems, in: International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2002, pp. 229-242.
30. M. Mahdian, Y. Ye, J. Zhang, A 2-approximation algorithm for the soft-capacitated facility location problem, in: International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2003, pp. 129-242.
31. A. Meyerson, Online facility location, in: IEEE Symposium on Foundations of Computer Science (FOCS), 2001, pp. 426-431.
32. P.B. Mirchandani, R.L. Francis, Discrete Location Theory, John Wiley and Sons, Inc., New York, 1990.
33. C. Papadimitriou, M. Yannakakis, The traveling salesman problem with distances one and two, Math. Oper. Res. 18 (1993) 1-11.
34. R. Ravi, F.S. Salman, Approximation algorithms for the travelling purchaser problem and its variants in network design, in: European Symposium on Algorithms (ESA), 1999, pp. 29-40.
35. R. Ravi, A. Sinha, Approximation algorithms for problems combining facility location and network design, Oper. Res. 54 (1) (2006) 73-81.
36. G. Robins, A. Zelikovsky, Improved Steiner tree approximation in graphs, in: ACM-SIAM Symposium on Discrete Algorithms (SODA), 2000, pp. 770-779.
37. C. Swamy, A. Kumar, Primal-dual algorithms for connected facility location problems, in: International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2002, pp. 256-269.
38. C. Swamy, A. Kumar, Primal-dual algorithms for connected facility location problems, Algorithmica 40 (4) (2004) 245-269.
39. K. Talwar, The single-sink buy-at-bulk LP has constant integrality gap, in: International Conference on Integer Programming and Combinatorial Optimization (IPCO), 2002, pp. 475-486.
40. A. van Zuylen, Deterministic sampling algorithms for network design, in: European Symposium on Algorithms (ESA), 2008, pp. 830-841.
41. A. van Zuylen, D. Williamson, A simpler and better derandomization of an approximation algorithm for single source rent-or-buy, Oper. Res. Lett. 35 (6) (2007) 707-712.
42. J. Vygen, Approximation algorithms for facility location problems (Lecture Notes), Report No. 05950-OR, Research Institute for Discrete Mathematics, University of Bonn, 2005.