Oblivious network design

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 970-979

  Gupta, Anupam ^a   Hajiaghayi, Mohammad T ^b   Räcke, Harald ^a  

^a Carnegie Mellon University   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; FUNCTIONS; ROUTERS;

AGGREGATION FUNCTION; COMPETITIVE RATIO; OBLIVIOUS ALGORITHMS; SUB-ADDITIVE FUNCTIONS;

PROBLEM SOLVING;

EID: 33244479432     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109665     Document Type: Conference Paper

References (39)

1. N. ALON, B. AWERBUCH, Y. AZAR, N. BUCHBINDER, AND J. S. NAOR, A general approach to online network optimization problems, in Proc. of the 15th SODA, 2004, pp. 942-951.
2. M. ANDREWS, Hardness of buy-at-bulk network design, in Proc. of the 45th FOCS, 2004, pp. 115-124.
3. D. APPLEGATE AND E. COHEN, Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs, in Proc. of the SIGCOMM, 2003, pp. 313-324.
4. B. AWERBUCH AND Y. AZAR, Buy-at-bulk network design, in Proc. of the 38th FOCS, 1997, pp. 542-547.
5. Y. AZAR, E. COHEN, A. FIAT, H. KAPLAN, AND H. RÄCKE, Optimal oblivious routing in polynomial time, in Proc. of the 35th STOC, 2003, pp. 383-388.
6. Y. BARTAL, Probabilistic approximations of metric spaces and its algorithmic applications, in Proc. of the 37th FOCS, 1996, pp. 184-193.
7. _, On approximating arbitrary metrics by tree metrics, in Proc. of the 30th STOC, 1998, pp. 161-168.
8. Y. BARTAL AND S. LEONARDI, On-line routing in all-optical networks, Theor. Comput. Sci., 221 (1999), pp. 19-39.
9. Also in Proc. 24th ICALP, 1997, pp. 516-526.
10. M. BIENKOWSKI, M. KORZENIOWSKI, AND H. RÄCKE, A practical algorithm for constructing oblivious routing schemes, in Proc. of the 15th SPAA, 2003, pp. 24-33.
11. H. T.-H. CHAN, A. GUPTA, B. M. MAGGS, AND S. ZHOU, On hierarchical routing in Doubling metrics, in Proc. of the 16th SODA, 2005, pp. 762-771.
12. M. CHARIKAR AND A. KARAGIOZOVA, On non-uniform multicommodity buy-at-bulk network design, in Proc. of the 37th STOC, 2005, pp. 176-182.
13. C. CHEKURI, S. KHANNA, AND B. SHEPHERD, The all-or-nothing multicommodity flow problem, in Proc. of the 36th STOC, 2004, pp. 156-165.
14. J. CHUZHOY, A. GUPTA, J. S. NAOR, AND A. SINHA, On the approximability of network design problems, in Proc. of the 16th SODA, 2005, pp. 943-951.
15. B. C. DEAN, M. X. GOEMANS, AND J. VONDRÁK, Approximating the stochastic knapsack problem: The benefit of adaptivity, in Proc. of the 45th FOCS, 2004, pp. 208-217.
16. J. FAKCHAROENPHOL, S. B. RAO, AND K. TALWAR, A tight bound on approximating arbitrary metrics by tree metrics, in Proc. of the 35th STOC, 2003, pp. 448-455.
17. N. GARG, R. KHANDEKAR, G. KONJEVOD, R. RAVI, F. S. SALMAN, AND A. SINHA, On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design formulation, in Proc. of the 8th IPCO, 2001, pp. 170-184.
18. A. GOEL AND D. ESTRIN, Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk, in Proc. of the 14th SODA, 2003, pp. 499-505.
19. S. GUHA, A. MEYERSON, AND K. MUNAGALA, Hierarchical placement and network design problems, in Proc. of the 41st FOCS, 2000, pp. 603-612.
20. S. GUHA, A. MEYERSON, AND K. MUNGALA, A constant factor approximation for the single sink edge installation problem, in Proc. of the 33rd STOC, 2001, pp. 383-388.
21. A. GUPTA, R. KRAUTHGAMER, AND J. R. LEE, Bounded geometries, fractals, and low-distortion embeddings, in Proc. of the 44th FOCS, 2003, pp. 534-543.
22. A. GUPTA, A. KUMAR, M. PÁL, AND T. ROUGHGARDEN, Approximations via cost-sharing: A simple approximation algorithm for the multicommodity rent-or-buy problem, in Proc. of the 44th FOCS, 2003, pp. 606-615.
23. A. GUPTA, A. KUMAR, AND T. ROUGHGARDEN, Simpler and better approximation algorithms for network design, in Proc. of the 35th STOC, 2003, pp. 365-372.
24. A. GUPTA, M. PÁL, R. RAVI, AND A. SINHA, Boosted sampling: Approximation algorithms for stochastic optimization problems, in Proc. of the 36th STOC, 2004, pp. 417-426.
25. M. T. HAJIAGHAYI, R. D. KLEINBERG, AND F. T. LEIGHTON, Improved lower and upper bounds for universal TSP in planar metrics, in Proc. of the 17th SODA, 2006. to appear.
26. C. HARRELSON, K. HILDRUM, AND S. B. RAO, A polynomial-time tree decomposition to minimize congestion, in Proc. of the 15th SPAA, 2003, pp. 34-43.
27. M. IMASE AND B. M. WAXMAN, Dynamic steiner tree problem, SIAM J. Discrete Math., 4 (1991), pp. 369-384.
28. N. IMMORLICA, D. KARGER, M. MINKOFF, AND V. MIRROKNI, On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems, in Proc. of the 15th SODA, 2004, pp. 684-693.
29. L. JIA, G. LIN, G. NOUBIR, R. RAJARAMAN, AND R. SUNDARAM, Universal approximations for TSP, Steiner tree, and set cover, in Proc. of the 37th STOC, 2005, pp. 386-395.
30. D. R. KARGER AND M. MINKOFF, Building Steiner trees with incomplete global knowledge, in Proc. of the 41 st FOCS, 2000, pp. 613-623.
31. A. KUMAR, A. GUPTA, AND T. ROUGHGARDEN, A constant-factor approximation algorithm for the multicommodity rent-or-buy problem, in Proc. of the 43rd FOCS, 2002, pp. 333-342.
32. B. M. MAGGS, F. MEYER AUF DER HEIDE, B. VÖCKING, AND M. WESTERMANN, Exploiting locality for networks of limited bandwidth, in Proc. of the 38th FOCS, 1997, pp. 284-293.
33. B. M. MAGGS, G. L. MILLER, O. PAREKH, R. RAVI, AND S. L. M. WOO, Finding effective support-tree preconditioners, in Proc. of the 17th SPAA, 2005, pp. 176-185.
34. A. MEYERSON, K. MUNAGALA, AND S. A. PLOTKIN, Cost-distance: Two metric network design, in Proc. of the 41st FOCS, 2000, pp. 624-630.
35. H. RÄCKE, Minimizing congestion in general networks, in Proc. of the 43rd FOCS, 2002, pp. 43-52.
36. T. ROUGHGARDEN AND E. TARDOS, How bad is selfish routing?, J. ACM, 49 (2002), pp. 236-259.
37. F. S. SALMAN, J. CHERIYAN, R. RAVI, AND S. SUBRAMANIAN, Approximating the single-sink link-installation problem in network design, SIAM J. Optimization, 11 (2000), pp. 595-610.
38. K. TALWAR, Single-sink buy-at-bulk LP has constant integrality gap, in Proc. of the 9th IPCO, 2002, pp. 475-486.
39. L. G. VALIANT AND G. J. BREBNER, Universal schemes for parallel communication, in Proc. of the 13th STOC, 1981, pp. 263-277.