Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1999, Pages 19-28

  Guruswami, Venkatesan ^a   Khanna, Sanjeev ^a   Rajaraman, Rajmohan ^a   Shepherd, Bruce ^a   Yannakakis, Mihalis ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CRITICAL PATH ANALYSIS; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

BOUNDED LENGTH EDGE-DISJOINT PATHS (BLEDP); MULTICOMMODITY FLOWS;

ALGORITHMS;

EID: 0032669862     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/301250.301262     Document Type: Article

References (25)