Waiting for trains: complexity results

DOI10.1007/978-3-030-39219-2_24zbMath1453.68093OpenAlexW3002448445MaRDI QIDQ779218

Stephan Zieger, Laura Vargas Koch, Dennis Fischer, Bjoern Tauer, Janosch Fuchs

Publication date: 21 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-39219-2_24

zbMATH Keywords

wormhole routingparameterized complexitytrain schedulingpacket routing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Traffic problems in operations research (90B20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Waiting for trains: complexity results