Folder complexes and multiflow combinatorial dualities

DOI10.1137/090767054MaRDI QIDQ3225110zbMATH OpenOpenAlexFDO

Authors 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

metricsmin-max theoremsmulticommodity flows

Mathematics Subject Classification ID

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

Recommendations

• On duality and fractionality of multicommodity flows in directed networks
• Tight spans of distances and the dual fractionality of undirected multiflow problems
• Combinatorial approaches to multiflow problems
• On one maximum multiflow problem and related metrics
• The maximum multiflow problems with bounded fractionality

Cited in

(11)

• On tight spans for directed distances
• Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
• Minimum 0-extension problems on directed metrics
• Weakly Modular Graphs and Nonpositive Curvature
• 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
• Discrete convex functions on graphs and their algorithmic applications
• scientific article; zbMATH DE number 7559417 (Why is no real title available?)
• Discrete convexity and polynomial solvability in minimum 0-extension problems
• On duality and fractionality of multicommodity flows in directed networks
• Subtree distances, tight spans and diversities

This page was built for publication: Folder complexes and multiflow combinatorial dualities

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