Affiliation:
1. Bell Labs, Murray Hill, New Jersey
Abstract
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
)-approximation algorithm on networks of size
M
unless
NP
⊆
ZPTIME
(
n
polylog
n
). This bound is almost tight given the
O
(log
M
/log log
M
)-approximation via randomized rounding due to Raghavan and Thompson.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献