Capacitated Confluent Flows: Complexity and Algorithms
From MaRDI portal
Publication:3563015
DOI10.1007/978-3-642-13073-1_31zbMath1284.68294OpenAlexW1603458698MaRDI QIDQ3563015
Daniel Dressler, Martin Strehler
Publication date: 28 May 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13073-1_31
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (3)
Minmax regret for sink location on dynamic flow paths with general capacities ⋮ Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows ⋮ Polynomial-time algorithms for special cases of the maximum confluent flow problem
This page was built for publication: Capacitated Confluent Flows: Complexity and Algorithms
