A node-capacitated Okamura-Seymour theorem

DOI10.1145/2488608.2488671MaRDI QIDQ6827084zbMATH OpenFDO

Authors James R. Lee, Manor Mendel, Mohammad Moharrami

Publication date 7 August 2014

Published in Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

zbMATH Keywords

multicommodity flowsmetric embeddings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Flows in graphs (05C21)

This page was built for publication: A node-capacitated Okamura-Seymour theorem

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