Search
Abstract
In this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs. In such setting a searcher, once a search strategy initially decides on the label of the searcher, can be present on an edge only if the label of the searcher and the label of the edge are the same. We prove that such searching problem is not monotone even for trees and moreover we give instances in which the number of recontamination events is Ω(n^2), where n is the size of a tree. Another negative result regards the NP-completeness of the monotone heterogeneous search in trees. The two above properties show that this problem behaves very differently from the classical edge search. On the other hand, if all edges of a particular label form a (connected) subtree of the input tree, then we show that optimal heterogeneous search strategy can be computed efficiently.
Citations
-
0
CrossRef
-
0
Web of Science
-
0
Scopus
Authors (3)
-
Łukasz Kuszner dr inż.
- Uniwersytet Gdański
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Conference activity
- Type:
- publikacja w wydawnictwie zbiorowym recenzowanym (także w materiałach konferencyjnych)
- Title of issue:
- Algorithms and Complexity strony 199 - 211
- Language:
- English
- Publication year:
- 2019
- Bibliographic description:
- Dereniowski D., Kuszner Ł., Ostrowski R.: Searching by Heterogeneous Agents// Algorithms and Complexity/ : , 2019, s.199-211
- DOI:
- Digital Object Identifier (open in new tab) 10.1007/978-3-030-17402-6_17
- Verified by:
- Gdańsk University of Technology
seen 95 times
Recommended for you
Approximation Strategies for Generalized Binary Search in Weighted Trees
- D. Dereniowski,
- A. Kosowski,
- P. Uznański
- + 1 authors