Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Logarithmic Hardness of the Directed Congestion Minimization Problem
 

Summary: Logarithmic Hardness of the Directed Congestion
Minimization Problem
Matthew Andrews
Bell Labs, Murray Hill, NJ
andrews@research.bell­labs.com
Lisa Zhang
Bell Labs, Murray Hill, NJ
ylz@research.bell­labs.com
ABSTRACT
We show that for any constant # > 0, there is
no#24 1-# M)­
approximation algorithm for the directed congestion min­
imization problem on networks of size M unless NP #
ZPT IME(n polylog n ). This bound is almost tight given the
O(log M/ log log M)­approximation via randomized round­
ing due to Raghavan and Thompson.
Categories and Subject Descriptors
F.2 [Analysis of Algorithms and Problem Complex­
ity]: Nonnumerical Algorithms and Problems
General Terms

  

Source: Andrews, Matthew - Mathematics of Networks and Systems, Mathematical Sciences Research Center, Bell Laboratories

 

Collections: Mathematics; Computer Technologies and Information Sciences