Hardness of the undirected congestion minimization problem

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 284-293

  Andrews, Matthew ^a   Zhang, Lisa ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Congestion minimization; Hardness of approximation; Undirected graphs

Indexed keywords

CONGESTION MINIMIZATION; HARDNESS OF APPROXIMATION; UNDIRECTED GRAPHS;

APPROXIMATION THEORY; GRAPH THEORY; PROBLEM SOLVING;

COMPUTATIONAL COMPLEXITY;

EID: 33747814715     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060633     Document Type: Conference Paper

References (7)

1. M. Andrews. Hardness of buy-at-bulk network design. In Proceedings of the 45th Annual Symposium on Foundations of Computer Science, pages 115-124, Rome, Italy, October 2004.
2. 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.
3. 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.
4. P. Erdös and H. Sachs. Reguläre graphen gegebener Taillenweite mit minimaler Knotenzahl. Wiss. Z. Uni. Halle-Wittenburg (Math. Nat.), 12:251-257, 1963.
5. R.M. Karp. Reducibility among combinatorial problems. In R.E. Miller and J.W. Thatcher, editors, Complexity of Computer Computations, pages 85-103, 1972.
6. P. Raghavan and C.D. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365-374, 1991.
7. R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763-803, 1998.