Negative instance for the edge patrolling beacon problem

DOI10.1007/978-3-030-90048-9_3OpenAlexW3211660670MaRDI QIDQ2695468

Jason S. Ku, Martin L. Demaine, Jayson Lynch, Adam Hesterberg, Hugo A. Akitaya, Matias Korman, Erik D. Demaine, Zachary R. Abel

Publication date: 31 March 2023

Full work available at URL: https://arxiv.org/abs/2006.01202

zbMATH Keywords

counterexamplebeacon routingedge patrolling

Mathematics Subject Classification ID

Applications of game theory (91A80) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Beacon-Based Algorithms for Geometric Routing
• An optimal algorithm to compute the inverse beacon attraction region
• Combinatorics of beacon-based routing in three dimensions

This page was built for publication: Negative instance for the edge patrolling beacon problem