Maximum vertex occupation time and inert fugitive: recontamination does help
Combinatorics
2021-03-05 v2
Abstract
Given a simple graph , we consider the node search problem with inert fugitive. We are interested in minimizing the maximum vertex occupation time, i.e. the maximum number of steps in which a vertex is occupied by a searcher during a search of . We prove that a search program which does not allow a recontamination may not find an optimal solution to this problem, and the difference between the maximum vertex occupation time computed by a monotone search program and a program without such restriction may be arbitrarily large.
Cite
@article{arxiv.0802.3512,
title = {Maximum vertex occupation time and inert fugitive: recontamination does help},
author = {Dariusz Dereniowski},
journal= {arXiv preprint arXiv:0802.3512},
year = {2021}
}
Comments
This paper has been withdrawn by the authors [arXiv admin]. The paper has been published and the final journal version has been improved by eliminating some technical errors