The authors prove strong NP-hardness for inspecting line segments on a line with two limited-range drones and propose approximation algorithms that achieve near-optimal makespan in experiments.
On Strong NP-Completeness of Rational Problems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimizing Line Segment Inspection with Limited-Range Drones
The authors prove strong NP-hardness for inspecting line segments on a line with two limited-range drones and propose approximation algorithms that achieve near-optimal makespan in experiments.