The unfortunate-flow problem

DOI10.4230/LIPICS.ICALP.2018.157MaRDI QIDQ5002847zbMATH OpenFDO

Authors Orna Kupferman, Gal Vardi

Publication date 28 July 2021

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2018.157

zbMATH Keywords

flow networkgraph algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Playing with the Maximum-Flow Problem
• Theory of uncontrollable flows -- a new type of network-flow theory as a model for the 21st century of multiple values
• Network flow with intermediate storage: models and algorithms
• Flow games
• Robust flows with losses and improvability in evacuation planning

Cites work

• A new approach to the maximum-flow problem
• A strongly polynomial minimum cost circulation algorithm
• Flow games
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• Maximal Flow Through a Network
• Network flows. Theory, algorithms, and applications.
• On the Complexity of Timetable and Multicommodity Flow Problems
• Parameterized complexity of firefighting
• Real addition and the polynomial hierarchy
• Saving critical nodes with firefighters is FPT
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

This page was built for publication: The unfortunate-flow problem

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