Publication:4449192
From MaRDI portal
zbMath1060.90511MaRDI QIDQ4449192
F. Bruce Shepherd, Marcelo Mydlarz, Chandra Chekuri
Publication date: 8 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190410.htm
tree; approximation algorithm; integrality gap; integer multicommodity flow; packing integer program
90C59: Approximation methods and heuristics in mathematical programming
90B10: Deterministic network models in operations research
68W25: Approximation algorithms
Related Items
Unnamed Item, A note on multiflows and treewidth, Resource allocation in bounded degree trees, A fixed-parameter tractability result for multicommodity demand flow in trees, Path multicoloring in spider graphs with even color multiplicity, Path multicoloring with fewer colors in spiders and caterpillars, Minimizing maximum fiber requirement in optical networks, Improved algorithms for scheduling unsplittable flows on paths