scientific article; zbMATH DE number 2038727

zbMATH Open1060.90511MaRDI QIDQ4449192FDOQ4449192

Authors: Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd 

Publication date: 8 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190410.htm

Title of this publication is not available (Why is that?)

Recommendations

• The all-or-nothing multicommodity flow problem
• Primal-dual approximation algorithms for integral flow and multicut in trees
• Designing multi-commodity flow trees
• A fixed-parameter tractability result for multicommodity demand flow in trees
• Designing multi-commodity flow trees

zbMATH Keywords

treeapproximation algorithmintegrality gapinteger multicommodity flowpacking integer program

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)

Cited In (16)

• The all-or-nothing multicommodity flow problem
• Designing multi-commodity flow trees
• Path multicoloring with fewer colors in spiders and caterpillars
• A note on multiflows and treewidth
• Title not available (Why is that?)
• A flexible model for tree-structured multi-commodity markets
• Title not available (Why is that?)
• Resource allocation in bounded degree trees
• Online Multi-Commodity Flow with High Demands
• Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
• A fixed-parameter tractability result for multicommodity demand flow in trees
• Improved algorithms for scheduling unsplittable flows on paths
• Minimizing maximum fiber requirement in optical networks
• Path multicoloring in spider graphs with even color multiplicity
• The Demand-Matching Problem
• Multicommodity flow in trees: packing via covering and iterated relaxation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449192)