Samenvatting
Given a set of agents that have fixed locations but can rotate at unit speed, we aim to find an
efficient schedule such that every pair of agents has looked at each other. We present schedules
and lower bounds for different geometric settings.
efficient schedule such that every pair of agents has looked at each other. We present schedules
and lower bounds for different geometric settings.
Originele taal-2 | Engels |
---|---|
Titel | EuroCG 2020 |
Subtitel | Book of Abstracts, 36th European Workshop on Computational Geometry |
Pagina's | 74:1-74:7 |
Aantal pagina's | 7 |
Status | Gepubliceerd - 16 mrt. 2020 |
Evenement | 36th European Workshop on Computational Geometry - Online, Würzburg, Duitsland Duur: 16 mrt. 2020 → 18 mrt. 2020 Congresnummer: 36 https://www1.pub.informatik.uni-wuerzburg.de/eurocg2020/ |
Congres
Congres | 36th European Workshop on Computational Geometry |
---|---|
Verkorte titel | EuroCG'20 |
Land/Regio | Duitsland |
Stad | Würzburg |
Periode | 16/03/20 → 18/03/20 |
Internet adres |