Logarithmic hardness of the directed congestion minimization problem

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

Citing 8
Cited 8

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
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Multicommodity Flow and Circuit Switching

HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences-Volume 7 - Volume 7
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 the undirected congestion minimization problem

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science

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
Polynomial flow-cut gaps and hardness of directed cut problems

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Polynomial flow-cut gaps and hardness of directed cut problems

Journal of the ACM (JACM)
Edge Disjoint Paths in Moderately Connected Graphs

SIAM Journal on Computing
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 for any constant ε 0, there is no Ω(log1-εM)-approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ ZPTIME(npolylog n). This bound is almost tight given the O(log M/ log log M)-approximation via randomized rounding due to Raghavan and Thompson.