Logarithmic hardness of the directed congestion minimization problem

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 517-526

  Andrews, Matthew ^a   Zhang, Lisa ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Congestion minimization; Directed graphs; Hardness of approximation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBLEM SOLVING;

CONGESTION MINIMIZATION; DIRECTED GRAPHS; HARDNESS OF APPROXIMATION;

NUMERICAL METHODS;

EID: 33748095331     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132592     Document Type: Conference Paper

References (10)

1. M. Andrews, J. Ghuzhoy, S. Khanna, and L. Zhang. Hardness of the undirected edge-disjoint paths problem with congestion. In Proceedings of the 46th Annual Symposium on Foundations of Computer Science, Pittsburgh, PA, October 2005.
2. M. Andrews and L. Zhang. Hardness of the undirected congestion minimization problem. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, May 2005.
3. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501-555, 1998.
4. J. Chuzhoy and J. Naor. New hardness results for congestion minimization and machine scheduling. In Proceedings of the 36th Annual ACM Symposium of Theory of Computing, pages 28-34, Chicago, IL, 2004.
5. V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yannakakis. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In Proceedings of the 31st Annual ACM Symposium of Theory of Computing, pages 19-28, Atlanta, GA, May 1999.
6. R.M. Karp. Reducibility among combinatorial problems. In R.E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85-103, 1972.
7. T. Leighton, S. Rao, and A. Srinivasan. Multicommodity flow and circuit switching. In Proceedings of the 31st Annual Hawaii International Conference on System Sciences, pages 459-465, 1998.
8. M. Martens and M. Skutella. Flows on few paths: Algorithms and lower bounds. In Proceedings of the 12th Annual European Symposium on Algorithms, pages 520-531, 2004.
9. P. Raghavan and C.D. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365-374, 1991.
10. R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763-803, 1998.