Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits

DOI10.1007/978-3-319-73117-9_26zbMath1445.68031arXiv1710.00466OpenAlexW2762808683MaRDI QIDQ5127186

Tomasz Jurdziński, Konstantinos Georgiou, Jurek Czyzowicz, Huda Chuangpishit, Leszek Gąsieniec, Evangelos Kranakis

Publication date: 21 October 2020

Published in: SOFSEM 2018: Theory and Practice of Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed systems (68M14) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40)

Related Items (6)

Two Robots Patrolling on a Line: Integer Version and Approximability ⋮ Perpetual maintenance of machines with different urgency requirements ⋮ Bamboo garden trimming problem: priority schedulings ⋮ Approximation algorithms for replenishment problems with fixed turnover times ⋮ Two-agent tree evacuation ⋮ Optimal patrolling of high priority segments while visiting the unit interval with a set of mobile robots

This page was built for publication: Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits