 |
Fakultät für Informatik - Technische Universität MünchenLehrstuhl für Effiziente Algorithmen |
 |
Die bibliographische Datenbank LEABib
Suchen •
Liste der Journale •
Liste der Serien •
Liste der Konferenzen •
Ausgewählte Publikationen  [1]
|
Hilfe 
|
 |
|
| Suche: Citkey="Guruswami-Khanna-Rajaraman-Shepherd-Yannakakis/03" |
|
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, Bruce Shepherd, Mihalis Yannakakis
Journal of Computer and System Sciences 67 (3), 2003, pp. 473-496
| Editors | Peter Auer, Nicolò Cesa-Bianchi, Claudio Gentile | |
| Publisher: | Academic Press | |
| Address: | San Diego-London | |
| Keywords: | Approximation algorithms, Bounded length edge-disjoint paths, Edge-disjoint paths, Hardness of approximation, Multicommodity flow, Network routing, Unsplittable flow, Vertex-disjoint paths | |
| URL: |
DOI:10.1016/S0022-0000(03)00066-7 | |
|
|
|
|