Direct routing: Algorithms and complexity

DOI10.1007/978-3-540-30140-0_14MaRDI QIDQ5464573zbMATH OpenOpenAlexFDO

Authors Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, P. G. Spirakis

Publication date 18 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100428

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms (68W40)

Recommendations

• Direct routing: Algorithms and complexity
• Packet Routing: Complexity and Algorithms
• Compact roundtrip routing in directed networks
• scientific article; zbMATH DE number 1303574
• The complexity of rerouting shortest paths
• The complexity of rerouting shortest paths
• On the computational complexity of continuous routing
• scientific article; zbMATH DE number 1538069
• Compact roundtrip routing in directed networks (extended abstract)
• scientific article; zbMATH DE number 1568938

Cited in

(8)

• Direct k-routing versus cross-docking: worst-case results
• Direct routing: Algorithms and complexity
• Packet Routing: Complexity and Algorithms
• A method of batching conflict routings in shuffle-exchange networks
• Directional Routing via Generalized st-Numberings
• Approximation and Online Algorithms
• On the flattest common supersequence method for deadlock-free routing in arbitrary networks
• Near-optimal schedules for simultaneous multicasts

This page was built for publication: Direct routing: Algorithms and complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464573)