scientific article; zbMATH DE number 2038727
From MaRDI portal
Publication:4449192
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)
Related Items (8)
A note on multiflows and treewidth ⋮ Improved algorithms for scheduling unsplittable flows on paths ⋮ Path multicoloring in spider graphs with even color multiplicity ⋮ Path multicoloring with fewer colors in spiders and caterpillars ⋮ Resource allocation in bounded degree trees ⋮ Unnamed Item ⋮ A fixed-parameter tractability result for multicommodity demand flow in trees ⋮ Minimizing maximum fiber requirement in optical networks
This page was built for publication:
