Hardness of the undirected congestion minimization problem

Authors:
Matthew Andrews;Lisa Zhang
Affiliations:
Bell Labs, Murray Hill, NJ;Bell Labs, Murray Hill, NJ
Venue:
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Year:
2005

Citing 5
Cited 16

Randomized rounding: a technique for provably good algorithms and algorithmic proofs

Combinatorica - Theory of Computing
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
A Parallel Repetition Theorem

SIAM Journal on Computing
New hardness results for congestion minimization and machine scheduling

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Hardness of Buy-at-Bulk Network Design

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science

Guest column: inapproximability results via Long Code based PCPs

ACM SIGACT News
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Logarithmic hardness of the directed congestion minimization problem

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The NP-completeness column: The many limits on approximation

ACM Transactions on Algorithms (TALG)
New hardness results for congestion minimization and machine scheduling

Journal of the ACM (JACM)
Logarithmic hardness of the undirected edge-disjoint paths problem

Journal of the ACM (JACM)
Hardness of routing with congestion in directed graphs

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On the approximation of the single source k-splittable flow problem

Journal of Discrete Algorithms
Inapproximability and approximability of minimal tree routing and coloring

Journal of Discrete Algorithms
Almost-tight hardness of directed congestion minimization

Journal of the ACM (JACM)
Reliable routings in networks with generalized link failure events

IEEE/ACM Transactions on Networking (TON)
Complexity of wavelength assignment in optical network optimization

IEEE/ACM Transactions on Networking (TON)
Convex combinations of single source unsplittable flows

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Edge Disjoint Paths in Moderately Connected Graphs

SIAM Journal on Computing
Reliable routings in networks with generalized link failure events

NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Edge disjoint paths in moderately connected graphs

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that there is no (log log M)1-ε approximation for the undirected congestion minimization problem unless NP ⊆ ZPTIME(npolylogn), where M is the size of the graph and ε is any positive constant.