Publication:4737515
From MaRDI portal
zbMath1049.90106MaRDI QIDQ4737515
Martin Skutella, Lisa K. Fleischer
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2337/23370036.htm
90C35: Programming involving graphs or networks
Related Items
Minimum-cost dynamic flows: The series-parallel case, Algorithms for the quickest time distribution of dynamic stochastic-flow networks, Paths of bounded length and their cuts: parameterized complexity and algorithms, Scheduling algorithms for procrastinators, A matheuristic approach for the quickest multicommodity \(k\)-splittable flow problem, Distribution and reliability evaluation of MAX-flow in dynamic multi-state flow networks, A tight bound on the speed-up through storage for quickest multi-commodity flows, A heuristic algorithm for the earliest arrival flow with multiple sources, Multicommodity flows over time: Efficient algorithms and complexity, A survey on models and algorithms for discrete evacuation planning network problems, Optimal Dynamic Multicommodity Flows in Networks, Traffic Networks and Flows over Time, Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms