arXiv (All)
open access
Freeze-Tag is NP-Hard in 3D with $L_1$ distance
Arkin et al. in 2002 introduced a scheduling-like problem called Freeze-Tag Problem (FTP) motivated by robot swarm activation. The input consists of the locations of n mobile punctual robots in some metric space or graph. Only one begins "active", while the others are initially "frozen". All active
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Parallel, Asymptotically Optimal Algorithms for Moving Target Traveling Salesman Problems#451646
- Parameterized Complexity of Scheduling Problems in Robotic Process Automation#984966
- Probabilistic GC-Constraints for Composite DNA#1234365
- Minimal Construction of Graphs with Maximum Robustness#971697
- Effizienzanalyse von Prozess- und Anlagenkonzepten zur schonenden Haltbarmachung von Lebensmitteln mittels neuartiger Hochdruckverfahren : Schlussbericht ; Teilprojekte der Technischen Universität Berlin: WP3: Inaktivierung von verberbsspezifischen Enzymen, WP4: Oxidative Veränderung tierischer Fette, WP5: Sensorische Veränderungen von Fleisch, WP6: Kinetische Analyse und modellbildende Auswertung, WP14: Wirtschaftlichkeitsanalyse#1306674
Record · ID 1198781
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive