Integral flow decomposition with minimum longest path length

DOI10.1016/J.EJOR.2015.06.012zbMath1346.90225OpenAlexW566841155MaRDI QIDQ320005

Krzysztof Pieńkosz, Kamil Kołtyś

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.06.012

zbMATH Keywords

networksapproximation algorithmsNP-hard problemflow decompositionintegral flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (1)

Safety and completeness in flow decompositions for RNA assembly

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of finding two disjoint paths with min-max objective function
• Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths
• An improved algorithm for decomposing arc flows into multipath flows

This page was built for publication: Integral flow decomposition with minimum longest path length