Tight spans of distances and the dual fractionality of undirected multiflow problems
From MaRDI portal
Publication:1044206
DOI10.1016/j.jctb.2009.03.001zbMath1190.05057OpenAlexW2123783074MaRDI QIDQ1044206
Publication date: 11 December 2009
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2433/126567
Related Items
On the fractionality of the path packing problem ⋮ 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 ⋮ The polytopal structure of the tight-span of a totally split-decomposable metric ⋮ Tree metrics and edge-disjoint \(S\)-paths ⋮ 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 ⋮ Optimal realizations of two-dimensional, totally-decomposable metrics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- Combinatorial approaches to multiflow problems
- Hereditary modular graphs
- Polyhedra related to undirected multicommodity flows
- Metrics with finite sets of primitive extensions
- Minimum 0-extensions of graph metrics
- A \(T_X\)-approach to some results on cuts and metrics
- A characterization of minimizable metrics in the multifacility location problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Tropical convexity
- On tight spans for directed distances
- Graphs of some CAT(0) complexes
- Characterization of the distance between subtrees of a tree by the associated tight span
- Six theorems about injective metric spaces
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
- On some connectivity properties of Eulerian graphs
- Generosity Helps or an 11-Competitive Algorithm for Three Servers
- Lectures on Polytopes
- Multi-Commodity Network Flows
- Geometry of cuts and metrics
