Deterministic sampling algorithms for network design

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

Volumn 5193 LNCS, Issue , 2008, Pages 830-841

  Van Zuylen, Anke ^a  

^a School of Chemical and Molecular Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

STOCHASTIC SYSTEMS; TRAVELING SALESMAN PROBLEM; TREES (MATHEMATICS);

CONNECTED FACILITY LOCATION; CONSTANT FACTORS; DETERMINISTIC SAMPLING; NETWORK DESIGN; NETWORK DESIGN PROBLEMS; RANDOMIZED ALGORITHMS; STOCHASTIC STEINER TREES; VIRTUAL PRIVATE NETWORK DESIGN;

APPROXIMATION ALGORITHMS;

EID: 57749188192     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87744-8_69     Document Type: Conference Paper

References (22)

1. Eisenbrand, F., Grandoni, F.: An improved approximation algorithm for virtual private network design. In: SODA, pp. 928-932 (2005)
2. Eisenbrand, F., Grandoni, F., Oriolo, G., Skutella, M.: New approaches for virtual private network design. SIAM J. Comput. 37(3), 706-721 (2007)
3. Eisenbrand, F., Grandoni, F., Rothvoß, T., Schäfer, G.: Approximating connected facility location problems via random facility sampling and core detouring. In: SODA, pp. 1174-1183 (2008)
4. Erdös, P., Spencer, J.: Probabilistic methods in combinatorics. Academic Press, London (1974)
5. Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. System Sci. 69(3), 485-497 (2004)
6. Garg, N., Gupta, A., Leonardi, S., Sankowski, P.: Stochastic analyses for online combinatorial optimization problems. In: SODA, pp. 942-951 (2008)
7. Garg, N., Khandekar, R., Konjevod, G., Ravi, R., Salman, F.S., Sinha, A.: On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, pp. 170-184. Springer, Heidelberg (2001)
8. Goemans, M.X., Bertsimas, D.J.: Survivable networks, linear programming relaxations and the parsimonious property. Math. Program. 60(2, Ser. A), 145-166 (1993)
9. Grandoni, F., Italiano, G.F.: Improved approximation for single-sink buy-at-bulk. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 111-120. Springer, Heidelberg (2006)
10. Gupta, A., Kumar, A., Pal, M., Roughgarden, T.: Approximation via cost-sharing: A simple approximation algorithm for the multicommodity rent-or-buy problem. In: FOCS, pp. 606-615 (2003)
11. Gupta, A., Kumar, A., Pál, M., Roughgarden, T.: Approximation via cost sharing: simpler and better approximation algorithms for network design. J. ACM 54(3), 11 (2007)
12. Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: STOC, pp. 365-372 (2003)
13. Gupta, A., Pal, M., Ravi, R., Sinha, A.: Boosted sampling: approximation algorithms for stochastic optimization. In: STOC, pp. 417-426 (2004)
14. Gupta, A., Srinivasan, A., Tardos, E.: Cost-sharing mechanisms for network design. Algorithmica 50(1), 98-119 (2008)
15. Hasan, M.K., Jung, H., Chwa, K.-Y.: Approximation algorithms for connected facility location problems. J. Comb. Optim, (to appear, 2008)
16. Immorlica, N., Karger, D., Minkoff, M., Mirrokni, V.S.: On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems. In: SODA, pp. 691-700 (2004)
17. Raghavan, P.: Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comput. System Sci. 37(2), 130-143 (1988)
18. Shmoys, D., Talwar, K.: A constant approximation algorithm for the a priori traveling salesman problem. In: IPCO (2008)
19. Shmoys, D.B., Williamson, D.P.: Analyzing the Held-Karp TSP bound: A monotonicity property with application. Inf. Process. Lett. 35, 281-285 (1990)
20. Talwar, K.: The single-sink buy-at-bulk LP has constant integrality gap. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol. 2337, pp. 475-486. Springer, Heidelberg (2002)
21. Williamson, D.P., van Zuylen, A.: A simpler and better derandomization of an approximation algorithm for single source rent-or-buy. Oper. Res. Lett. 35(6), 707-712 (2007)
22. Wolsey, L.A.: Heuristic analysis, linear programming and branch and bound. Math. Prog. Study 13, 121-134 (1980)