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

DOI10.1007/S004930050040zbMATH Open0924.90126OpenAlexW2086358569MaRDI QIDQ1297737FDOQ1297737

Authors: 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

Recommendations

• Minimum \((2,r)\)-metrics and integer multiflows
• Metrics and undirected cuts
• On one maximum multiflow problem and related metrics

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)

Cited In (4)

• Metrics and undirected cuts
• 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

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