Local Search for Hop-Constrained Directed Steiner Tree Problem with Application to UAV-Based Multi-Target Surveillance
Oleg P. Burdakov, Patrick Doherty, Kvarnström Jonas · NATO science for peace and security series. D, Information and communication security · 2014
We consider the directed Steiner tree problem (DSTP) with a constraint on the total number of arcs (hops) in the tree. This problem is known to be NP-hard, and therefore, only heuristics can be applied in the case of its large-scale instances.