scientific article; zbMATH DE number 1263177

MaRDI QIDQ4234047zbMATH OpenFDO

Authors David R. Karger, Serge Plotkin

Publication date 18 October 1999

zbMATH Keywords

approximate packingminimum cost multicommodity flowround-robin

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Integer programming (90C10) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
• Publication:4886082
• Publication:4886083

Cited in

(10)

• An augmented Lagrangian approach to multi-commodity flow problems with conversions
• Modifying edges of a network to obtain short subgraphs
• Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
• A penalty function heuristic for the resource constrained shortest path problem
• Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities
• scientific article; zbMATH DE number 910906 (Why is no real title available?)
• Multicommodity network flows: A survey. II: Solution methods
• Solving Multicommodity Flow Problems by an Approximation Scheme
• Modifying networks to obtain low cost trees
• High-accuracy multicommodity flows via iterative refinement

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 Q4234047)