Approximate max-integral-flow/min-multicut theorems

DOI10.1145/1007352.1007433zbMath1192.90236OpenAlexW2071346321MaRDI QIDQ3581010

Kenji Obata

Publication date: 15 August 2010

Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Models and methods for solving the problem of network vulnerability ⋮ Disjoint paths in sparse graphs ⋮ Multicommodity flows in tree-like networks ⋮ Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs

This page was built for publication: Approximate max-integral-flow/min-multicut theorems