Simple on-line algorithms for the maximum disjoint paths problem

DOI10.1007/s00453-004-1086-1zbMath1134.90523OpenAlexW1994611404MaRDI QIDQ1889861

Christian Scheideler, Petr Kolman

Publication date: 13 December 2004

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-004-1086-1

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

LS(graph): a constraint-based local search for constraint optimization on trees and paths ⋮ Finding edge-disjoint paths in networks: an ant colony optimization algorithm

This page was built for publication: Simple on-line algorithms for the maximum disjoint paths problem