University of Leicester
Browse

Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow

Download (340.33 kB)
chapter
posted on 2008-02-07, 11:05 authored by Thomas Erlebach
Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow

History

Citation

Lecture Notes in Computer Science, 2006, 3484, pp.97-134

Published in

Lecture Notes in Computer Science

Publisher

Springer Verlag

Available date

2008-02-07

Notes

This is the authors' final draft of the Book Chapter published as Lecture Notes in Computer Science, 2006, vol. 3484, pp.97-134. The final published version is available at http://www.springerlink.com/content/776r8537473327kg/?p=bd70936677d64284ba69425ca9725b6f&pi=171

Language

en

Administrator link

Usage metrics

    University of Leicester Publications

    Categories

    No categories selected

    Keywords

    IR content

    Licence

    All Rights Reserved

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC