Local Search for Hop-Constrained Directed Steiner Tree Problem with Application to UAV-Based Multi-Target Surveillance

Examining Robustness and Vulnerability of Networked Systems Pub Date : 1900-01-01 DOI:10.3233/978-1-61499-391-9-26

O. Burdakov, P. Doherty, Jonas Kvarnström

引用次数: 4

Abstract

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 app ...

查看原文本刊更多论文

跳跃约束有向斯坦纳树问题的局部搜索及其在无人机多目标监视中的应用

考虑有向斯坦纳树问题(DSTP)，该问题对树的总跳数有约束。这个问题被认为是np困难的，因此，只有启发式才能被应用。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Examining Robustness and Vulnerability of Networked Systems

自引率

0.00%

发文量