Scheduling computer and manufacturing processes
Scheduling computer and manufacturing processes
Capture of an intruder by mobile agents
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Computers and Operations Research
An annotated bibliography on guaranteed graph searching
Theoretical Computer Science
Decontamination of hypercubes by mobile agents
Networks - Games, Interdiction, and Human Interaction Problems on Networks
Connected graph searching in chordal graphs
Discrete Applied Mathematics
Pathwidth is NP-Hard for Weighted Trees
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Capturing an intruder in the pyramid
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Connected searching of weighted trees
Theoretical Computer Science
Hierarchical visibility for guaranteed search in large-scale outdoor terrain
Autonomous Agents and Multi-Agent Systems
Multi-UAV motion planning for guaranteed search
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
| Hi-index | 0.00 |
In this paper we consider the problem of connected edge searching of weighted trees. Authors claim in [L. Barrière at al., Capture of an intruder by mobile agents, SPAA'02 (2002) 200-209] that there exists a polynomial-time algorithm for finding an optimal search strategy. However, due to some flaws in their algorithm, the problem turns out to be open. It is proven in this paper that the considered problem is strongly NP-complete even for node-weighted trees (the weight of each edge is 1). It is also shown that there exists a polynomial-time algorithm for finding an optimal connected search strategy for a given bounded degree tree with arbitrary weights on the edges and on the vertices.