Filming runners with drones is hard

DOI10.1016/J.TCS.2026.116129MaRDI QIDQ7316940zbMATH OpenFDO

Authors J. M. Díaz-Báñez, R. Fabila-Monroy

Publication date 21 August 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116129

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites work

• Modelling the mobile target covering problem using flying drones
• Parallel drone scheduling vehicle routing problems with collective drones
• Solving the length constrained K-drones rural postman problem
• The complexity of finding maximum disjoint paths with length constraints

This page was built for publication: Filming runners with drones is hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7316940)