Integer plane multiflows with a mixed number of demands
From MaRDI portal
Publication:1322028
DOI10.1006/jctb.1993.1062zbMath0798.90044OpenAlexW2091250471MaRDI QIDQ1322028
Publication date: 5 May 1994
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1993.1062
Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)
Related Items (10)
Parameterized Resiliency Problems via Integer Linear Programming ⋮ The disjoint shortest paths problem ⋮ On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems ⋮ Approximating maximum integral multiflows on bounded genus graphs ⋮ Multiflow Feasibility: An Annotated Tableau ⋮ Minimal multicut and maximal integer multiflow: a survey ⋮ Max-multiflow/min-multicut for G+H series-parallel ⋮ Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs ⋮ Parameterized resiliency problems ⋮ On the complexity of the planar directed edge-disjoint paths problem
This page was built for publication: Integer plane multiflows with a mixed number of demands
