Facility location with client latencies: Linear programming based techniques for minimum latency problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6655 LNCS, Issue , 2011, Pages 92-103

  Chakrabarty, Deeparnab ^a   Swamy, Chaitanya ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION FACTOR; CONNECTION-COSTS; FACILITY LOCATIONS; GROUP STEINER TREE; LATENCY PROBLEM; ROOT NODES;

COMBINATORIAL OPTIMIZATION; COSTS; LINEAR PROGRAMMING; LOCATION; OPTIMIZATION; TREES (MATHEMATICS);

INTEGER PROGRAMMING;

EID: 79959992329     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20807-2_8     Document Type: Conference Paper

References (20)

1. Archer, A., Levin, A., Williamson, D.: A faster, better approximation algorithm for the minimum latency problem. SIAM J. Comput. 37(5), 1472-1498 (2008)
2. Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., Sudan, M.: The Minimum Latency Problem. In: Proc. 26th STOC, pp. 163-171 (1994)
3. Byrka, J.: An optimal bifactor approximation algorithm for the metric uncapacitated facility location problem. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol. 4627, pp. 29-43. Springer, Heidelberg (2007)
4. Chakrabarty, D., Swamy, C.: Facility Location with Client Latencies: Linear Programming based Techniques for Minimum Latency Problems, http://arxiv.org/abs/1009.2452
5. Charikar, M., Chekuri, C., Goel, A., Guha, S.: Rounding via trees: deterministic approximation algorithms for Group Steiner Trees and k-median. In: Proceedings of the 30th STOC, pp. 114-123 (1998)
6. Chaudhuri, K., Godfrey, P.B., Rao, S., Talwar, K.: Paths, Trees and Minimum Latency Tours. In: Proceedings of 44th FOCS, pp. 36-45 (2003)
7. Fakcharoenphol, J., Harrelson, C., Rao, S.: The k-traveling repairman problem. ACM Trans. on Alg. 3(4), Article 40 (2007)
8. Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: Proc. 35th STOC, pp. 448-455 (2003)
9. Feige, U., Lovász, L., Tetali, P.: Approximating min sum set cover. Algorithmica 40(4), 219-234 (2004)
10. Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner tree problem. Journal of Algorithms 37(1), 66-84 (2000)
11. Goemans, M., Bertsimas, D.: Survivable networks, linear programming relaxations and the parsimonious property. Math. Programming 60, 145-166 (1993)
12. Goemans, M., Kleinberg, J.: An improved approximation ratio for the minimum latency problem. In: Proceedings of 7th SODA, pp. 152-158 (1996)
13. Gupta, A., Krishnaswamy, R., Nagarajan, V., Ravi, R.: Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. In: Proceedings of 37th ICALP, pp. 690-701
14. Halperin, E., Krauthgamer, R.: Polylogarithmic inapproximability. In: Proceedings of 35th STOC, pp. 585-594 (2003)
15. Mirchandani, P., Francis, R. (eds.): Discrete Location Theory. John Wiley and Sons, Inc., New York (1990)
16. Nagarajan, V.: Approximation Algorithms for Sequencing Problems. Ph.D. thesis, Tepper School of Business, Carnegie Mellon University (2009)
17. Shmoys, D.B., Tardos, É., Aardal, K.I.: Approximation algorithms for facility location problems. In: Proceedings of 29th STOC, pp. 265-274 (1997)
18. Shmoys, D., Williamson, D.: Analyzing the Held-Karp TSP bound: a monotonicity property with application. Inf. Process. Lett. 35(6), 281-285 (1990)
19. Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia (2002)
20. Wolsey, L.: Heuristic analysis, linear programming and branch and bound. Mathematical Programming Study 13, 121-134 (1980)