A combinatorial algorithm for the minimum \((2,r)\)-metric problem and some generalizations

DOI10.1007/s004930050040zbMath0924.90126OpenAlexW2086358569MaRDI QIDQ1297737

Alexander V. Karzanov

Publication date: 14 September 1999

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930050040

zbMATH Keywords

minimum \((2,r)\)-metric problem

Mathematics Subject Classification ID

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

Related Items (3)

On a general framework for network representability in discrete optimization ⋮ One more well-solved case of the multifacility location problem ⋮ A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes

This page was built for publication: A combinatorial algorithm for the minimum \((2,r)\)-metric problem and some generalizations