The expanding search ratio of a graph

Spyros Angelopoulos 1 Christoph Dürr 1 Thomas Lidbetter
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : We study the problem of searching for a hidden target in an environment that is modeled by an edge-weighted graph. Most of the previous work on this problem considers the pathwise cost formulation, in which the cost incurred by the searcher is the overall time to locate the target, assuming that the searcher moves at unit speed. More recent work introduced the setting of expanding search in which the searcher incurs cost only upon visiting previously unexplored areas of the graph. Such a paradigm is useful in modeling problems in which the cost of re-exploration is negligible (such as coal mining). In our work we study algorithmic and computational issues of expanding search, for a variety of search environments including general graphs, trees and star-like graphs. In particular, we rely on the deterministic and randomized search ratio as the performance measures of search strategies, which were originally introduced by Koutsoupias and Papadimitriou [ICALP 1996] in the context of pathwise search. The search ratio is essentially the best competitive ratio among all possible strategies. Our main objective is to explore how the transition from pathwise to expanding search affects the competitive analysis, which has applications to optimization problems beyond the strict boundaries of search problems.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01344126
Contributor : Christoph Dürr <>
Submitted on : Monday, July 11, 2016 - 1:31:00 PM
Last modification on : Thursday, March 21, 2019 - 1:03:58 PM

Links full text

Identifiers

Citation

Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter. The expanding search ratio of a graph. The 33rd Symposium on Theoretical Aspects of Computer Science (STACS), Feb 2016, Orléans, France. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Proc. of the 33rd Symposium on Theoretical Aspects of Computer Science (STACS), 47, pp.4:1--9:14, Leibniz International Proceedings in Informatics (LIPIcs). 〈http://www.univ-orleans.fr/lifo/events/STACS2016/〉. 〈10.4230/LIPIcs.STACS.2016.9〉. 〈hal-01344126〉

Share

Metrics

Record views

45