scientific article; zbMATH DE number 1947047
From MaRDI portal
Publication:4411277
zbMath1013.90112MaRDI QIDQ4411277
Amit Kumar, Anupam Gupta, Chandra Chekuri, Amit Chakrabarti
Publication date: 7 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2462/24620051.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items
A knapsack intersection hierarchy ⋮ How unsplittable-flow-covering helps scheduling with job-dependent cost functions ⋮ Resource allocation in bounded degree trees ⋮ A fixed-parameter tractability result for multicommodity demand flow in trees ⋮ A logarithmic approximation for unsplittable flow on line graphs