scientific article; zbMATH DE number 1760012

MaRDI QIDQ4536937zbMATH OpenFDO

Authors Rastislav Královič, Peter Ružička, D. Štefankovič

Publication date 6 November 2002

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99)

Recommendations

• The complexity of shortest path and dilation bounded interval routing
• scientific article; zbMATH DE number 1038840
• scientific article; zbMATH DE number 1517100
• scientific article; zbMATH DE number 1361484
• The Compactness of Interval Routing

Cited in

(21)

• A short note on the lower bound of dilation for \(O(\log n)\)-label interval routing
• The complexity of shortest path and dilation bounded interval routing
• A survey on interval routing
• On the complexity of multi-dimensional interval routing schemes
• The complexity of the characterization of networks supporting shortest-path interval routing.
• Interval routing \(\and\) layered cross product: compact routing schemes for butterflies, meshes of trees, fat trees and Beneš networks
• Searching among intervals and compact routing tables
• All-shortest-path 2-interval routing is NP-complete
• On the hardness of minimizing space for all-shortest-path interval routing schemes
• The Complexity of Interval Routing on Random Graphs
• Worst Case Bounds for Shortest Path Interval Routing
• scientific article; zbMATH DE number 1340883 (Why is no real title available?)
• scientific article; zbMATH DE number 1517100 (Why is no real title available?)
• Low-congested interval routing schemes for hypercubelike networks
• Lower bounds for compact routing (extended abstract)
• The Compactness of Interval Routing
• scientific article; zbMATH DE number 1361484 (Why is no real title available?)
• The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
• Concerning the time bounds of existing shortest watchman route algorithms
• A lower bound for linear interval routing
• Average stretch analysis of compact routing schemes

This page was built for publication:

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