On the computational complexity of continuous routing

DOI10.1016/0196-6774(89)90025-4MaRDI QIDQ4203819zbMATH OpenOpenAlexFDO

Authors Yukon Chang, Susanne E. Hambrusch, Janos Simon

Publication date 1989

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(89)90025-4

zbMATH Keywords

continuous broadcastingcontinuous routingdistributed algorithmsnetworkNP-hardness

Mathematics Subject Classification ID

Theory of operating systems (68N25) Theory of software (68N99) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the complexity of an optimal routing tree problem
• The complexity of rerouting shortest paths
• The complexity of rerouting shortest paths
• Routing in undirected graphs with constant congestion
• Routing in undirected graphs with constant congestion
• On the complexity of multi-dimensional interval routing schemes
• scientific article; zbMATH DE number 1568938
• The Complexity of Interval Routing on Random Graphs
• The complexity of interval routing on random graphs
• The Compactness of Interval Routing

Cited in

(9)

• On the complexity of an optimal routing tree problem
• The complexity of routing with few collisions
• The complexity of routing with collision avoidance
• Direct routing: Algorithms and complexity
• Routing equal-size messages on a slotted ring
• Some complexity results about packet radio networks (Corresp.)
• Distributed Multi-Destination Routing: The Constraints of Local Information
• scientific article; zbMATH DE number 4083048 (Why is no real title available?)
• Algorithms – ESA 2004

This page was built for publication: On the computational complexity of continuous routing

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