Corrigendum: Erratum to "Minimum cost flows with minimum quantities" [Information Processing Letters 111 (11) (2011) 533-537]

  • Authors:

  • Sven O. Krumke;Clemens Thielen

  • Affiliations:

  • Department of Mathematics, University of Kaiserslautern, Paul-Ehrlich-Str. 14, D-67663 Kaiserslautern, Germany;Department of Mathematics, University of Kaiserslautern, Paul-Ehrlich-Str. 14, D-67663 Kaiserslautern, Germany

  • Venue:
  • Information Processing Letters
  • Year:
  • 2012

Quantified Score

Hi-index 0.89

Visualization

Abstract

This note identifies an error in the fully polynomial-time approximation scheme on series-parallel graphs presented in our paper ''Minimum cost flows with minimum quantities'' which appeared as [Sven O. Krumke, Clemens Thielen, Minimum cost flows with minimum quantities, Information Processing Letters 111 (11) (2011) 533-537]. In fact, we prove inapproximability of the problem on series-parallel graphs and of a related problem, thereby identifying a similar error in a related paper.