Metrics with finite sets of primitive extensions

DOI10.1007/BF01608533zbMath0946.90069MaRDI QIDQ1293426

Alexander V. Karzanov

Publication date: 26 October 2000

Published in: Annals of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

isometric embeddingtight spanmulticommodity flowfinite metricmultiterminal cutmetric extension

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Distance in graphs (05C12)

Related Items (12)

On tight spans for directed distances ⋮ Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees ⋮ Metric packing for \(K_ 3 + K_ 3\) ⋮ Bounded fractionality of the multiflow feasibility problem for demand graph \(K_3 + K_3\) and related maximization problems ⋮ Graphs of some CAT(0) complexes ⋮ On duality and fractionality of multicommodity flows in directed networks ⋮ Unnamed Item ⋮ Discrete convexity and polynomial solvability in minimum 0-extension problems ⋮ Minimum 0-extension problems on directed metrics ⋮ Weakly Modular Graphs and Nonpositive Curvature ⋮ Tight spans of distances and the dual fractionality of undirected multiflow problems ⋮ Optimal realizations of two-dimensional, totally-decomposable metrics

Cites Work

• Unnamed Item
• Half-integral five-terminus flows
• Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
• Networks with Condorcet solutions
• Hereditary modular graphs
• A Helly theorem in weakly modular space
• Minimum 0-extensions of graph metrics
• Minimum \((2,r)\)-metrics and integer multiflows
• Six theorems about injective metric spaces
• On the Extreme Rays of the Metric Cone
• On some connectivity properties of Eulerian graphs
• The Complexity of Multiterminal Cuts

This page was built for publication: Metrics with finite sets of primitive extensions