Publication:4828931
From MaRDI portal
zbMath1241.68132MaRDI QIDQ4828931
Christian Scheideler, Petr Kolman
Publication date: 29 November 2004
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
68R10: Graph theory (including graph drawing) in computer science
90B10: Deterministic network models in operations research
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Flows on few paths: Algorithms and lower bounds, Short length Menger's theorem and reliable optical routing, Minimal multicut and maximal integer multiflow: a survey, A note on multiflows and treewidth, A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem, The maximum edge-disjoint paths problem in complete graphs, Maximizing residual capacity in connection-oriented networks, Disjoint paths in sparse graphs, A note on the greedy algorithm for the unsplittable flow problem, Crossing number, pair-crossing number, and expansion, Finding edge-disjoint paths in networks: an ant colony optimization algorithm, Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms