Multiroute flows: cut-trees and realizability

DOI10.1016/J.DISOPT.2005.03.005MaRDI QIDQ2581318zbMATH OpenOpenAlexFDO

Authors R. Chandrasekaran, K. P. K. Nair, Santosh N. Kabadi

Publication date 9 January 2006

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2005.03.005

zbMATH Keywords

cut-treemultiroute flownetwork realizability

Mathematics Subject Classification ID

Connectivity (05C40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Multiway cut and integer flow problems in trees
• An approximation algorithm for multiroute flow decomposition
• Flows, cuts and integral routing in graphs -- an approximation algorithmist's perspective
• The multiroute maximum flow problem revisited
• Single source multiroute flows and cuts on uniform capacity networks
• Single source multiroute flows and cuts on uniform capacity networks
• Revisiting parametric multi-terminal problems: maximum flows, minimum cuts and cut-tree computations
• On multiroute maximum flows in networks.
• Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing
• Towards duality of multicommodity multiroute cuts and flows: multilevel ball-growing

Cites work

• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Generalizing the all-pairs min cut problem
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 961880 (Why is no real title available?)
• Integer Solution to Synthesis of Communication Networks
• Multi-terminal multipath flows: synthesis
• Multi-Terminal Network Flows
• Multiterminal flows and cuts
• Network flows. Theory, algorithms, and applications.
• Network synthesis with few edges
• On multiroute maximum flows in networks.
• Simple Constructions for Multiterminal Network Flow Synthesis
• Solution Bases of Multiterminal Cut Problems

Cited in

(3)

• Multiterminal flows and cuts
• Impact of a varying capacity on the all pairs 2-route network flows
• Multiflow Feasibility: An Annotated Tableau

This page was built for publication: Multiroute flows: cut-trees and realizability

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