Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, Bruce Shepherd, Mihalis Yannakakis  Home/Search
Context Related
| belllabs.com/cm/ms/who/bshep/...edp.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/bsh...pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study the approximability of edge-disjoint paths and related problems. In the edge-disjoint paths problem (EDP), we are given a network G with source-sink pairs (s i ; t i ), 1 i k, and the goal is to nd a largest subset of source-sink pairs that can be simultaneously connected in an edge-disjoint manner. We show that in directed networks, for any > 0, EDP is NP-hard to approximate within m . We also design simple approximation algorithms that achieve essentially matching... (Update)
Cited by: More
An Approximation Algorithm for the Disjoint Paths Problem in.. - Kleinberg (2005) (Correct)
The All-or-Nothing Multicommodity Flow Problem - Chekuri, Khanna, Shepherd (2004) (Correct)
Hardness of the Undirected Edge-Disjoint Paths Problem - Andrews, Zhang (2005) (Correct)
Similar documents (at the sentence level):
60.6%: Near-Optimal Hardness Results and Approximation.. - Guruswami.. (2000) (Correct)
Active bibliography (related documents): More All
0.4: Approximating Disjoint-Path Problems Using Packing Integer.. - Kolliopoulos, Stein (1998) (Correct)
0.2: Measures of Dynamical Complexity - Andrei Soklakov Rhul (2001) (Correct)
0.2: Placing Probes along the Genome Using Pair-wise Distance Data - Casey, Mishra, Wigler (Correct)
Similar documents based on text: More All
0.3: On the Hardness of 4-coloring a 3-colorable Graph - Guruswami, Khanna (2000) (Correct)
0.3: The 2-Catalog Segmentation Problem - Dodis, Guruswami, Khanna (1999) (Correct)
0.2: Time-Constrained Scheduling of Weighted Packets on.. - Adler, Khanna.. (1999) (Correct)
Related documents from co-citation: More All
34: Approximation algorithms for disjoint paths problems - Kleinberg - 1996
22: Approximation algorithms for disjoint paths and related routing and packing prob.. (context) - Baveja, Srinivasan - 1998
19: Randomized rounding: a technique for provably good algorithms and algorithmic pr.. (context) - Raghavan, Thompson - 1987
BibTeX entry: (Update)
V. Guruswami, S. Khanna, B. Shepherd, R. Rajaraman and M. Yannakakis (1999). Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems. To appear in 31st ACM Symp. on Theory of Computing. http://citeseer.ist.psu.edu/guruswami99nearoptimal.html More
@inproceedings{ guruswami99nearoptimal,
author = "Venkatesan Guruswami and Sanjeev Khanna and Rajmohan Rajaraman and Bruce Shepherd and Mihalis Yannakakis",
title = "Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems",
pages = "19--28",
year = "1999",
url = "citeseer.ist.psu.edu/guruswami99nearoptimal.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-co.. (context) - Garey, Johnson - 1979
375 Probability inequalities for sums of bounded random variable.. (context) - Hoeffding - 1963
70 Primal-dual approximation algorithms for integral ow and mul.. (context) - Garg, Vazirani et al. - 1993
67 Improved Bounds for All Optical Routing (context) - Aumann, Rabani - 1995
63 The directed subgraph homeomorphism problem (context) - Fortune, Hopcroft et al. - 1980
34 Approximation algorithms for disjoint paths and related rout.. (context) - Baveja, Srinivasan - 1998
30 Clique is hard to approximate within n (context) - astad
20 the complexity of vertex-disjoint length-restricted path pro.. - Bley - 1998
13 the complexity of timetable and multicommodity ow problems (context) - Even, Itai et al. - 1976
7 the single source unsplittable ow problem (context) - Dinitz, Garg et al. - 1998
4 A measure of asymptotic eciency for tests of a hypothesis ba.. (context) - Chernoff - 1952
3 Algorithm for solution of a problem of maximum ow in network.. (context) - Dinitz - 1970
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://cm.bell-labs.com/cm/ms/who/bshep/pub.html): More
The Stable Paths Problem and Interdomain Routing - Griffin, Shepherd, Wilfong (Correct)
Some Strategies for Reserving Resilient Capacity - Brightwell, Oriolo, Shepherd (1998) (Correct)
Multicommodity Demand Flow in a Tree and Packing Integer.. - Chekuri, Mydlarz, Shepherd (2003) (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