An \(O(1)\)-approximation algorithm for the 2-dimensional geometric freeze-tag problem

DOI10.1016/j.ipl.2015.02.011zbMath1328.68309OpenAlexW1984420725MaRDI QIDQ2345867

Alireza Bagheri, Zahra Moezkarimi, Hamidreza Keshavarz, Ehsan Najafi Yazdi

Publication date: 21 May 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.02.011

zbMATH Keywords

approximation algorithmsbroadcastingswarm roboticsfreeze-tag problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40)

Cites Work

• Unnamed Item
• A PTAS for geometric 2-FTP
• The freeze-tag problem: How to wake up a swarm of robots
• Cooperative TSP
• Classes of graphs which approximate the complete Euclidean graph
• Approximating the degree-bounded minimum diameter spanning tree problem
• Minimizing movement
• A Neighborhood Search Technique for the Freeze Tag Problem

This page was built for publication: An \(O(1)\)-approximation algorithm for the 2-dimensional geometric freeze-tag problem