Degree-constrained network flows
From MaRDI portal
Publication:3549669
DOI10.1145/1250790.1250889zbMath1232.68015OpenAlexW2116215252MaRDI QIDQ3549669
No author found.
Publication date: 5 January 2009
Published in: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1250790.1250889
Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items
Single-Sink Multicommodity Flow with Side Constraints, Maximum edge-disjoint paths in planar graphs with congestion 2