A fast algorithm for finding a maximum free multiflow in an inner Eulerian network and some generalizatons
From MaRDI portal
Publication:1280281
DOI10.1007/PL00009811zbMath0914.90110OpenAlexW2069968725MaRDI QIDQ1280281
Toshihide Ibaraki, Hiroshi Nagamochi, Alexander V. Karzanov
Publication date: 14 March 1999
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009811
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items
A compact representation for minimizers of \(k\)-submodular functions, Free multiflows in bidirected and skew-symmetric graphs, Min-cost multiflows in node-capacitated undirected networks, On tight spans for directed distances, Finding Maximum Edge-Disjoint Paths Between Multiple Terminals, Tree metrics and edge-disjoint \(S\)-paths, A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem, On the Query Complexity of Testing Orientations for Being Eulerian, On duality and fractionality of multicommodity flows in directed networks, A fast algorithm for the path 2-packing problem, A linear programming formulation of Mader's edge-disjoint paths problem
