A lower bound for nearly minimal adaptive and hot potato algorithms
From MaRDI portal
Publication:4595508
DOI10.1007/3-540-61680-2_76zbMath1379.68377OpenAlexW1544785026MaRDI QIDQ4595508
Donald D. Chinn, Assaf Schuster, Ishai Ben-Aroya
Publication date: 5 December 2017
Published in: Algorithms — ESA '96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61680-2_76
Analysis of algorithms (68W40) Network design and communication in computer systems (68M10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12)
This page was built for publication: A lower bound for nearly minimal adaptive and hot potato algorithms
