Article

Hardness of the undirected congestion minimization problem

Authors:

Matthew Andrews,

Lisa ZhangAuthors Info & Claims

STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Pages 284 - 293

https://doi.org/10.1145/1060590.1060633

Published: 22 May 2005 Publication History

Get Access

Abstract

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

References

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[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.

Google Scholar

[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.

Crossref

Google Scholar

[6]

P. Raghavan and C.D. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365--374, 1991.

Digital Library

Google Scholar

[7]

R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763--803, 1998.

Digital Library

Google Scholar

Cited By

View all

Texler OFutschik Dkučera Mjamriška OSochorová ŠChai MTulyakov SSÝkora D(2020)Interactive video stylization using few-shot patch-based trainingACM Transactions on Graphics10.1145/3386569.339245339:4(73:1-73:11)Online publication date: 12-Aug-2020
https://dl.acm.org/doi/10.1145/3386569.3392453
Cucerca SDidyk PSeidel HBabaei V(2020)Computational image marking on metals via laser induced heatingACM Transactions on Graphics10.1145/3386569.339242339:4(70:1-70:11)Online publication date: 12-Aug-2020
https://dl.acm.org/doi/10.1145/3386569.3392423
Chen SSu WGao LXia SFu H(2020)DeepFaceDrawingACM Transactions on Graphics10.1145/3386569.339238639:4(72:1-72:16)Online publication date: 12-Aug-2020
https://dl.acm.org/doi/10.1145/3386569.3392386
Show More Cited By

Index Terms

Hardness of the undirected congestion minimization problem
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Hardness of the undirected edge-disjoint paths problem
STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

We show that there is no log ^{1 over 3-ε} M approximation for the undirected Edge-Disjoint Paths problem unless NP ⊆ ZPTIME(n^polylog(n), where M is the size of the graph and ε is any positive constant. This hardness result also applies to the undirected ...
Hardness of the Undirected Congestion Minimization Problem

We show that there is no $\gamma\log\log M/\log\log\log M$-approximation for the undirected congestion minimization problem unless $NP \subseteq ZPTIME(n^{{\rm polylog} n})$, where $M$ is the size of the graph and γ is some positive constant.
Almost-tight hardness of directed congestion minimization

Given a set of demands in a directed graph, the directed congestion minimization problem is to route every demand with the objective of minimizing the heaviest load over all edges. We show that for any constant ε > 0, there is no Ω(log^1−ε M)-...

Comments

Information & Contributors

Information

Published In

STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

May 2005

778 pages

ISBN:1581139608

DOI:10.1145/1060590

General Chair:
Hal Gabow
University of Colorado
,
Program Chair:
Ronald Fagin
IBM Almaden Research Center

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 May 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

STOC05

Sponsor:

STOC05: Symposium on Theory of Computing

May 22 - 24, 2005

MD, Baltimore, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

46
Total Citations
View Citations
259
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Texler OFutschik Dkučera Mjamriška OSochorová ŠChai MTulyakov SSÝkora D(2020)Interactive video stylization using few-shot patch-based trainingACM Transactions on Graphics10.1145/3386569.339245339:4(73:1-73:11)Online publication date: 12-Aug-2020
https://dl.acm.org/doi/10.1145/3386569.3392453
Cucerca SDidyk PSeidel HBabaei V(2020)Computational image marking on metals via laser induced heatingACM Transactions on Graphics10.1145/3386569.339242339:4(70:1-70:11)Online publication date: 12-Aug-2020
https://dl.acm.org/doi/10.1145/3386569.3392423
Chen SSu WGao LXia SFu H(2020)DeepFaceDrawingACM Transactions on Graphics10.1145/3386569.339238639:4(72:1-72:16)Online publication date: 12-Aug-2020
https://dl.acm.org/doi/10.1145/3386569.3392386
Luo XHuang JSzeliski RMatzen KKopf J(2020)Consistent video depth estimationACM Transactions on Graphics10.1145/3386569.339237739:4(71:1-71:13)Online publication date: 12-Aug-2020
https://dl.acm.org/doi/10.1145/3386569.3392377
Heifferon B(2017)New technologies, patient experience, theoretical approaches and heuristics in RHMCommunication Design Quarterly10.1145/3131201.31312025:2(4-18)Online publication date: 4-Aug-2017
https://dl.acm.org/doi/10.1145/3131201.3131202
Shi YZhang FLiu Z(2017)Hardness of Routing for Minimizing Superlinear Polynomial Cost in Directed GraphsTheory and Applications of Models of Computation10.1007/978-3-319-55911-7_41(571-585)Online publication date: 21-Mar-2017
https://doi.org/10.1007/978-3-319-55911-7_41
Rajaraman R(2016)Randomized RoundingEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_327(1753-1757)Online publication date: 22-Apr-2016
https://doi.org/10.1007/978-1-4939-2864-4_327
Cowen L(2016)Packet RoutingEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_273(1500-1503)Online publication date: 22-Apr-2016
https://doi.org/10.1007/978-1-4939-2864-4_273
Hoang AFujino T(2014)Intra-Masking Dual-Rail Memory on LUT Implementation for SCA-Resistant AES on FPGAACM Transactions on Reconfigurable Technology and Systems10.1145/26175957:2(1-19)Online publication date: 4-Jul-2014
https://dl.acm.org/doi/10.1145/2617595
Andrews M(2010)Approximation Algorithms for the Edge-Disjoint Paths Problem via Raecke DecompositionsProceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science10.1109/FOCS.2010.33(277-286)Online publication date: 23-Oct-2010
https://dl.acm.org/doi/10.1109/FOCS.2010.33
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Hardness of the undirected edge-disjoint paths problem