
تعداد نشریات | 43 |
تعداد شمارهها | 1,737 |
تعداد مقالات | 14,198 |
تعداد مشاهده مقاله | 34,893,087 |
تعداد دریافت فایل اصل مقاله | 13,924,308 |
APPROXIMATION ALGORITHMS FOR THE FREEZE TAG PROBLEM INSIDE POLYGONS | ||
Transactions on Combinatorics | ||
مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 12 خرداد 1404 | ||
نوع مقاله: Research Paper | ||
شناسه دیجیتال (DOI): 10.22108/toc.2025.143753.2229 | ||
نویسندگان | ||
Fatemeh Rajabi-Alni* 1؛ Alireza Bagheri2؛ Behrouz Minaei-Bidgoli3 | ||
1Department of Computer Engineering, Iran University of Science and Technology, Tehran, Iran | ||
2Amirkabir University of Technology | ||
3Department of Computer Engineering, Iran University of Science and Technology | ||
چکیده | ||
The freeze tag problem (FTP) aims to awaken a swarm of robots with one or more initial awake robots as soon as possible. Each awake robot must touch a sleeping robot to wake it up. Once a robot is awakened, it can assist in awakening other sleeping robots. We study this problem inside a polygonal domain and present approximation algorithms for it. | ||
کلیدواژهها | ||
Freeze tag problem؛ swarm robotics؛ polygonal domain؛ t-spanner؛ geodesic graphs | ||
آمار تعداد مشاهده مقاله: 10 |