Folder Complexes and Multiflow Combinatorial Dualities

DOI10.1137/090767054zbMath1401.90192OpenAlexW2138658182MaRDI QIDQ3225110

Hiroshi Hirai

Publication date: 15 March 2012

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090767054

zbMATH Keywords

multicommodity flowsmetricsmin-max theorems

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polytopes and polyhedra (52B99) Flows in graphs (05C21)

Related Items (10)

On tight spans for directed distances ⋮ Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees ⋮ Bounded fractionality of the multiflow feasibility problem for demand graph \(K_3 + K_3\) and related maximization problems ⋮ Tree metrics and edge-disjoint \(S\)-paths ⋮ On duality and fractionality of multicommodity flows in directed networks ⋮ Unnamed Item ⋮ Discrete Convex Functions on Graphs and Their Algorithmic Applications ⋮ Discrete convexity and polynomial solvability in minimum 0-extension problems ⋮ Minimum 0-extension problems on directed metrics ⋮ Weakly Modular Graphs and Nonpositive Curvature

This page was built for publication: Folder Complexes and Multiflow Combinatorial Dualities