Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow

DOI10.1007/11671541_4zbMath1132.90373OpenAlexW2164286571MaRDI QIDQ5450805

Erlebach, Thomas

Publication date: 14 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11671541_4

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (max. 100)

Solving the edge‐disjoint paths problem using a two‐stage method ⋮ Multicommodity flow in trees: packing via covering and iterated relaxation

This page was built for publication: Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow