A New Bound for Pure Greedy Hot Potato Routing

DOI10.1007/978-3-540-70918-3_5zbMATH Open1186.68024OpenAlexW1598798357MaRDI QIDQ3590922FDOQ3590922

Authors: Manfred Kunde 

Publication date: 3 September 2007

Published in: STACS 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_5

Recommendations

• Publication:4952652
• Greedy hot-potato routing on the two-dimensional mesh
• A lower bound for nearly minimal adaptive and hot potato algorithms
• scientific article; zbMATH DE number 1256693
• A lower bound for nearly minimal adaptive and hot potato algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Network design and communication in computer systems (68M10)

Cited In (3)

• Routing with bounded buffers and hot-potato routing in vertex-symmetric networks
• Randomized Single-Target Hot-Potato Routing
• Deterministic Hot-Potato Permutation Routing on the Mesh and the Torus

This page was built for publication: A New Bound for Pure Greedy Hot Potato Routing

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