The maximum multiflow problems with bounded fractionality

DOI10.1145/1806689.1806707MaRDI QIDQ2875137zbMATH OpenOpenAlexFDO

Authors Hiroshi Hirai

Publication date 13 August 2014

Published in Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1806689.1806707

zbMATH Keywords

metricsmulticommodity flowspolynomial time algorithms

Mathematics Subject Classification ID

Flows in graphs (05C21)

Recommendations

• The maximum multiflow problems with bounded fractionality
• Bounded fractionality of the multiflow feasibility problem for demand graph \(K_3 + K_3\) and related maximization problems
• Tight spans of distances and the dual fractionality of undirected multiflow problems
• On the fractionality of the path packing problem
• Combinatorial approaches to multiflow problems

Cited in

(13)

• Tight spans of distances and the dual fractionality of undirected multiflow problems
• On one maximum multiflow problem and related metrics
• Fractional multi-commodity flow problem: duality and optimality conditions
• On the Langberg-Médard multiple unicast conjecture
• On the fractionality of the path packing problem
• Integer plane multiflow maximisation: one-quarter-approximation and gaps
• Folder complexes and multiflow combinatorial dualities
• scientific article; zbMATH DE number 66623 (Why is no real title available?)
• 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
• Criticality for multicommodity flows
• The maximum multiflow problems with bounded fractionality
• On duality and fractionality of multicommodity flows in directed networks

This page was built for publication: The maximum multiflow problems with bounded fractionality

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