scientific article; zbMATH DE number 2119660

zbMath1241.68132MaRDI QIDQ4828931

Petr Kolman, Christian Scheideler

Publication date: 29 November 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (16)

Crossing number, pair-crossing number, and expansion ⋮ A note on multiflows and treewidth ⋮ A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem ⋮ Euclidean prize-collecting Steiner forest ⋮ Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling ⋮ Paths of bounded length and their cuts: parameterized complexity and algorithms ⋮ The maximum edge-disjoint paths problem in complete graphs ⋮ Finding edge-disjoint paths in networks: an ant colony optimization algorithm ⋮ Maximizing residual capacity in connection-oriented networks ⋮ Disjoint paths in sparse graphs ⋮ Unnamed Item ⋮ Minimal multicut and maximal integer multiflow: a survey ⋮ Short length Menger's theorem and reliable optical routing ⋮ A note on the greedy algorithm for the unsplittable flow problem ⋮ Flows on few paths: Algorithms and lower bounds ⋮ Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms

This page was built for publication: