Improved bounds for the unsplittable flow problem
From MaRDI portal
Publication:3410948
DOI10.1016/j.jalgor.2004.07.006zbMath1101.68110MaRDI QIDQ3410948
Petr Kolman, Christian Scheideler
Publication date: 7 December 2006
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.07.006
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
68R10: Graph theory (including graph drawing) in computer science
90B10: Deterministic network models in operations research
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow, A logarithmic approximation for unsplittable flow on line graphs, Unnamed Item, Paths of bounded length and their cuts: parameterized complexity and algorithms, Length-bounded cuts: proper interval graphs and structural parameters, On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths, Survey on Oblivious Routing Strategies, Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms