Affiliation:
1. Bell Labs, Murray Hill, New Jersey
Abstract
We show that there is no log
⅓ − ε
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 All-or-Nothing Multicommodity Flow problem and the undirected Node-Disjoint Paths problem.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献