A lower bound for nearly minimal adaptive and hot potato algorithms

DOI10.1007/PL00009219zbMath0899.68049OpenAlexW2026845685MaRDI QIDQ1393080

Ishai Ben-Aroya, Assaf Schuster, Donald D. Chinn

Publication date: 10 November 1998

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

hot potato routingpermutation routing algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (3)

Direct routing: Algorithms and complexity ⋮ Many-to-many routing on trees via matchings ⋮ Networks on which hot-potato routing does not livelock

This page was built for publication: A lower bound for nearly minimal adaptive and hot potato algorithms