A note on the greedy algorithm for the unsplittable flow problem

DOI10.1016/S0020-0190(03)00351-XzbMath1178.68683MaRDI QIDQ1028992

Petr Kolman

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

graph algorithmsapproximation algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (2)

On the minimum cost multiple-source unsplittable flow problem ⋮ Disjoint paths in sparse graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
• Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

This page was built for publication: A note on the greedy algorithm for the unsplittable flow problem