Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5897558
DOI10.1007/11604686zbMath1171.90334MaRDI QIDQ5897558
Anita Schöbel, Riko Jacob, Michael Gatto, Leon Peeters
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06)
Related Items (4)
Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems ⋮ Extensions to online delay management on a single train line: New bounds for delay minimization and profit maximization ⋮ Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases ⋮ Delay Management Problem: Complexity Results and Robust Algorithms
This page was built for publication: Graph-Theoretic Concepts in Computer Science
