Fast deterministic approximation for the multicommodity flow problem

DOI10.1016/S0025-5610(96)00072-XMaRDI QIDQ1373725zbMATH OpenOpenAlexFDO

Authors Tomasz Radzik

Publication date 25 November 1997

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0025-5610(96)00072-x

zbMATH Keywords

approximate solutionboundmaximum concurrent flow problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Recommendations

• Publication:4886082
• Fast approximation algorithms for multicommodity flow problems
• Approximating fractional multicommodity flow independent of the number of commodities

Cited in

(20)

• Multicommodity network flows: A survey. II: Solution methods
• Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
• A combinatorial approximation algorithm for supply chain network flow problem
• A natural randomization strategy for multicommodity flow and related algorithms
• A fixed-parameter tractability result for multicommodity demand flow in trees
• scientific article; zbMATH DE number 910906 (Why is no real title available?)
• Approximation and Online Algorithms
• A fast polynomial time algorithm for logistics network flows
• A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem
• Approximating fractional multicommodity flow independent of the number of commodities
• Multicast Routing and Design of Sparse Connectors
• A combinatorial approximation algorithm for concurrent flow problem and its application
• Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
• scientific article; zbMATH DE number 910907 (Why is no real title available?)
• Speeding up Karmarkar's algorithm for multicommodity flows
• Faster approximate multicommodity flow using quadratically coupled flows
• Faster approximation schemes for fractional multicommodity flow problems
• scientific article; zbMATH DE number 515935 (Why is no real title available?)
• Faster approximation schemes for fractional multicommodity flow problems
• Approximation algorithms for general packing problems and their application to the multicast congestion problem

This page was built for publication: Fast deterministic approximation for the multicommodity flow problem

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