scientific article; zbMATH DE number 910907

MaRDI QIDQ4886083zbMATH OpenFDO

Authors Anil P. Kamath, O. Palmon, Serge Plotkin

Publication date 28 July 1996

zbMATH Keywords

minimum-cost multicommodity flow problemdeterministic approximation algorithm

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
• Fast deterministic approximation for the multicommodity flow problem
• Fast approximation algorithms for multicommodity flow problems
• Publication:4886082
• scientific article; zbMATH DE number 1187163

Cited in

(8)

• Multicommodity network flows: A survey. II: Solution methods
• Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
• scientific article; zbMATH DE number 1303553 (Why is no real title available?)
• Approximation and Online Algorithms
• A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
• A minimum cost network flow model for the maximum covering and patrol routing problem
• Speeding up Karmarkar's algorithm for multicommodity flows
• Faster approximation schemes for fractional multicommodity flow problems

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