Approximations for the disjoint paths problem in high-diameter planar networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
Decision algorithms for unsplittable flow and the half-disjoint paths problem
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Improved bounds for all optical routing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A PCP characterization of NP with optimal amortized query complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints
Journal of Computer and System Sciences
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Mathematics of Operations Research
Non-approximability results for optimization problems on bounded degree instances
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Disjoint paths in densely embedded graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Improved Approximation Algorithms for Unsplittable Flow Problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
On the Single-Source Unsplittable Flow Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Single-source unsplittable flow
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximation algorithms for disjoint paths problems
Approximation algorithms for disjoint paths problems
Graph decomposition and a greedy algorithm for edge-disjoint paths
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The all-or-nothing multicommodity flow problem
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
Multicommodity flow, well-linked terminals, and routing problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
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
An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Combination can be hard: approximability of the unique coverage problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A quasi-PTAS for unsplittable flow on line graphs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Edge-disjoint paths in Planar graphs with constant congestion
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
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
Multicommodity demand flow in a tree and packing integer programs
ACM Transactions on Algorithms (TALG)
The maximum edge-disjoint paths problem in complete graphs
Theoretical Computer Science
Almost-tight hardness of directed congestion minimization
Journal of the ACM (JACM)
A logarithmic approximation for unsplittable flow on line graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Complexity of wavelength assignment in optical network optimization
IEEE/ACM Transactions on Networking (TON)
Approximability of packing disjoint cycles
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
K-Tree: A multiple tree video multicast protocol for Ad hoc wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Edge Disjoint Paths in Moderately Connected Graphs
SIAM Journal on Computing
The disjoint paths problem: algorithm and structure
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Approximation strategies for routing edge disjoint paths in complete graphs
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Edge disjoint paths in moderately connected graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The complexity of minimum convex coloring
Discrete Applied Mathematics
The maximum integer multiterminal flow problem
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Approximation algorithms and hardness of integral concurrent flow
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Routing in undirected graphs with constant congestion
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The maximum integer multiterminal flow problem in directed graphs
Operations Research Letters
On the admission of dependent flows in powerful sensor networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
We show that there is no log 1 over 3-ε M approximation for the undirected Edge-Disjoint Paths problem unless NP ⊆ ZPTIME(npolylog(n), where M is the size of the graph and ε is any positive constant. This hardness result also applies to the undirected All-or-Nothing Multicommodity Flow problem and the undirected Node-Disjoint Paths problem.