Degree-constrained network flows

DOI10.1145/1250790.1250889MaRDI QIDQ3549669zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

network flow\(d\)-furcated flowminimum congestion \(d\)-furcated flow

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Mathematical problems of computer architecture (68M07)

Cited in

(2)

• Single-Sink Multicommodity Flow with Side Constraints
• Maximum edge-disjoint paths in planar graphs with congestion 2

This page was built for publication: Degree-constrained network flows

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