Optimal hierarchical decompositions for congestion minimization in networks

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 255-263

  Räcke, Harald ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

Approximating metrics by tree metrics; Hierarchical decompositions; Oblivious routing

Indexed keywords

APPROXIMATION ALGORITHMS; APPROXIMATION THEORY; COMPUTATION THEORY; COST FUNCTIONS; FORESTRY; GRAPHIC METHODS; PROBABILITY DISTRIBUTIONS; ROUTING ALGORITHMS;

APPROXIMATING METRICS BY TREE METRICS; ASYMPTOTICALLY OPTIMAL; COMPETITIVE ALGORITHMS; CONGESTION MINIMIZATION; DECOMPOSITION TECHNIQUE; HIERARCHICAL DECOMPOSITIONS; OBLIVIOUS ROUTING; PERFORMANCE GUARANTEES;

TREES (MATHEMATICS);

EID: 57049141635     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374415     Document Type: Conference Paper

References (31)

1. N. Alon, B. Awerbuch, Y. Azar, N. Buchbinder, and J. S. Naor. A general approach to online network optimization problems. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 577-586, 2004.
2. K. Andreev, C. Garrod, B. M. Maggs, and A. Meyerson, Simultaneous source location. In Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pages 13-26, 2004.
3. D. Applegate and E. Cohen. Making intra-domain routing robust to changing and uncertain traffic demands: Understanding fundamental tradeoffs. In Proceedings of the ACM Symposium on Communications Architectures & Protocols (SIGCOMM), pages 313-324, 2003.
4. S. Arora, J. Lee, and A. Naor. Euclidean distortion and the sparsest cut. In Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), pages 553-562, 2005.
5. S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings, and graph partitionings. In Proceedings of the 36th ACM Symposium on Theory of Computing (STOC), pages 222-231, 2004.
6. J. Aspnes, Y. Azar, A. Fiat, S. A. Plotkin, and O. Waarts. On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the ACM, 44(3):486-504, 1997. Also in Proc. 25th STOC, 1993, pp. 623-631.
7. Y. Aumann and Y. Rabani, An O(log κ) approximate min-cut max-flow theorem and approximation algorithm, SIAM Journal on Computing, 27(1):291-301, 1998.
8. B. Awerbuch and Y. Azar. Competitive multicast routing. Wireless Networks, 1(1):107-114, 1995.
9. Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Räcke. Optimal oblivious routing in polynomial time. In Proceedings of the 35th ACM Symposium on Theory of Computing (STOC), pages 383-388, 2003.
10. Y. Bartal. Probabilistic approximations of metric spaces and its algorithmic applications. In Proceedings of the 37th IEEE Symposium on Foundations of Computer Science (FOCS), pages 184-193, 1996.
11. Y. Bartal. On approximating arbitrary metrics by tree metrics. In Proceedings of the 30th ACM Symposium on Theory of Computing (STOC), pages 161-168, 1998.
12. Y. Bartal and S. Leonardi. On-line routing in all-optical networks. Theoretical Computer Science, 221(l-2):19-39, 1999. Also in Proc. 24th ICALP, 1997, pp. 516-526.
13. M. Bienkowski, M. Korzeniowski, and H. Räcke. A practical algorithm for constructing oblivious routing schemes. In Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 24-33, 2003.
14. M. Charikar, C. Chekuri, A. Goel, S. Guha, and S. A. Plotkin. Approximating a finite metric by a small number of tree metrics. In Proceedings of the 39th IEEE Symposium on Foundations of Computer Science (FOCS), pages 379-388, 1998.
15. S. Chawla, A. Gupta, and H. Räcke. An improved approximation to sparsest cut. In Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 102-111, 2005.
16. J. Fakcharoenphol, S. B. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In Proceedings of the 35th ACM Symposium on Theory of Computing (STOC), pages 448-455, 2003.
17. U. Feige and R. Krauthgamer. A polylogarithmic approximation of the minimum bisection. SIAM Review, 48(1):99-130, 2006. Also in Proc. 41st FOCS, 2000, pp. 105-115 and in SICOMP 31 :(4):1090-1118, 2002.
18. N. Garg and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proceedings of the 39th IEEE Symposium on Foundations of Computer Science (FOCS), pages 300-309, 1998.
19. N. Garg, V. V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. SIAM Journal on Computing, 25(2):235-251, 1996.
20. N. Garg, V. V. Vazirani, and M. Yannakakis. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica, 18(1):3-20, 1997.
21. D. Golovin, V. Nagarajan, and M. Singh. Approximating the κ-multicut problem. In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 621-630, 2006.
22. C. Harrelson, K. Hildrum, and S. B. Rao. A polynomial-time tree decomposition to minimize congestion. In Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 34-43, 2003.
23. R. Khandekar. Lagrangian Relaxation based Algorithms for Convex Programming Problems. PhD thesis, Indian Institute of Technology Dehli, 2004.
24. F. T. Leighton and S. B. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science (FOCS), pages 422-431, 1988.
25. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995. Also in Proc. 35th FOCS, 1994, pp. 577-591.
26. M. Luby and N. Nisan. A parallel approximation algorithm for positive linear programming. In Proceedings of the 25th ACM Symposium on Theory of Computing (STOC), pages 448-457, 1993.
27. B. M. Maggs, F. Meyer auf der Heide, B. Vöcking, and M. Westermann. Exploiting locality for networks of limited bandwidth. In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science (FOCS), pages 284-293, 1997.
28. V. Nagarajan and R. Ravi. Approximation algorithms for requirement cut on graphs. In Proceedings of the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pages 209-220, 2005.
29. S. A. Plotkin, D. B. Shmoys, and É. Tardos. Fast approximation algorithms for fractional packing and covering problems. In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science (FOCS), pages 495-504, 1991.
30. H. Räcke. Minimizing congestion in general networks. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS), pages 43-52, 2002.
31. N. E. Young. Sequential and parallel algorithms for mixed packing and covering. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pages 538-546, 2001.