Matthew Andrews, Lisa Zhang  Home/Search
Context Related
| belllabs.com/cm/ms/wh...stoc05cong.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: belllabs.com/cm/ms/who/and...pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We show that there is no (log log M) problem unless NP ` ZPT IME(n ), where M is the size of the graph and " is any positive constant. (Update)
Cited by: More
Hardness of the Edge-Disjoint Paths Problem with Congestion - Andrews, Zhang (2005) (Correct)
Active bibliography (related documents): More All
0.5: Bounds on Fiber Minimization in Optical Networks with Fixed.. - Andrews, Zhang (2005) (Correct)
0.0: Hardness of Buy-at-Bulk Network Design - Andrews (2004) (Correct)
0.0: Packing Cycles in Undirected Graphs - Caprara, Panconesi, Rizzi (2001) (Correct)
Similar documents based on text: More All
0.3: Packet Routing with Arbitrary End-to-End Delay Requirements - Andrews, Zhang (1998) (Correct)
0.3: The Effects of Temporary Sessions on Network Performance - Andrews, Zhang (2000) (Correct)
0.3: The Access Network Design Problem - Andrews, Zhang (1998) (Correct)
BibTeX entry: (Update)
M. Andrews and L. Zhang. Hardness of the undirected congestion minimization problem. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005. http://citeseer.ist.psu.edu/article/andrews04hardness.html More
@misc{ andrews05hardness,
author = "M. Andrews and L. Zhang",
title = "Hardness of the undirected congestion minimization problem",
text = "M. Andrews and L. Zhang. Hardness of the undirected congestion minimization
problem. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing,
2005.",
year = "2005",
url = "citeseer.ist.psu.edu/article/andrews04hardness.html" }
Citations (may not include all citations):403 Proof verification and the hardness of approximation problem.. - Arora, Lund et al. - 1998
186 Randomized rounding: a technique for provably good algorithm.. (context) - Raghavan, Thompson - 1991
118 A parallel repetition theorem - Raz - 1998
17 Regulare graphen gegebener Taillenweite mit minimaler Knoten.. (context) - Erdos, Sachs - 1963
2 Hardness of buy-at-bulk network design - Andrews - 2004
2 New hardness results for congestion minimization and machine.. - Chuzhoy, Naor - 2004
Documents on the same site (http://cm.bell-labs.com/cm/ms/who/andrews/pub.html): More
Hardness of Buy-at-Bulk Network Design - Andrews (2004) (Correct)
Automatic Methods for Hiding Latency in High.. - Andrews, Leighton.. (1996) (Correct)
New Algorithms for the Disk Scheduling Problem - Andrews, Bender, Zhang (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC