Erratum to ``Minimum cost flows with minimum quantities

DOI10.1016/J.IPL.2012.03.016zbMath1243.68186OpenAlexW352835358MaRDI QIDQ436590

Sven O. Krumke, Clemens Thielen

Publication date: 25 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.03.016

zbMATH Keywords

computational complexityminimum cost flowapproximation scheme

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Complexity and approximability of the maximum flow problem with minimum quantities

Cites Work

• Unnamed Item
• On the flow cost lowering problem
• Minimum cost flows with minimum quantities

This page was built for publication: Erratum to ``Minimum cost flows with minimum quantities