Packet Routing: Complexity and Algorithms
From MaRDI portal
Publication:3558928
DOI10.1007/978-3-642-12450-1_20zbMath1284.68093OpenAlexW1760952262MaRDI QIDQ3558928
Andreas Wiese, Martin Skutella, Britta Peis
Publication date: 11 May 2010
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.919.7335
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (8)
Scheduling trains with small stretch on a unidirectional line ⋮ Scheduling Problems over Network of Machines ⋮ Computational complexity of convoy movement planning problems ⋮ Universal Packet Routing with Arbitrary Bandwidths and Transit Times ⋮ Scheduling problems over a network of machines ⋮ Multiple train repositioning operations in a railyard network ⋮ Train Scheduling on a Unidirectional Path ⋮ Bounding Residence Times for Atomic Dynamic Routings
This page was built for publication: Packet Routing: Complexity and Algorithms
