Integer and unsplittable multiflows in series-parallel digraphs

DOI10.1007/978-3-031-93112-3_31MaRDI QIDQ6880115zbMATH OpenFDO

Authors Mohammed Majthoub Almoghrabi, Martin Skutella, Philipp Warode

Publication date 22 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-93112-3_31

Mathematics Subject Classification ID

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

Cites work

• Approximating the single source unsplittable min-cost flow problem
• Approximation algorithms for single-source unsplittable flow
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Convex Combinations of Single Source Unsplittable Flows
• Cut-sufficient directed 2-commodity multiflow topologies
• Flow-cut gaps for integer and fractional multiflows
• Handbook of Approximation Algorithms and Metaheuristics
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• Multicommodity flows in planar graphs
• Network flow algorithms
• Network flows. Theory, algorithms, and applications.
• NP-completeness of some edge-disjoint paths problems
• On max-flow min-cut and integral flow properties for multicommodity flows in directed networks
• On the single-source unsplittable flow problem
• Single source unsplittable flows with arc-wise lower and upper bounds
• Single-source unsplittable flows in planar graphs
• The Recognition of Series Parallel Digraphs

This page was built for publication: Integer and unsplittable multiflows in series-parallel digraphs

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