Cookies?
Library Header Image
LSE Research Online LSE Library Services

The expanding search ratio of a graph

Angelopoulos, Spyros and Dürr, Christoph and Lidbetter, Thomas (2016) The expanding search ratio of a graph. In: Ollinger, Nicolas and Vollmer, Heribert, (eds.) 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs). (47). Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Wadern, Germany, 9:1-9:14. ISBN 9783959770019

[img]
Preview
PDF - Published Version
Available under License Creative Commons Attribution.

Download (799kB) | Preview

Identification Number: 10.4230/LIPIcs.STACS.2016.9

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.

Item Type: Book Section
Official URL: https://www.dagstuhl.de/
Additional Information: © 2016 The Authors © CC BY
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA76 Computer software
Sets: Departments > Mathematics
Date Deposited: 26 Apr 2016 14:44
Last Modified: 26 Apr 2016 16:50
URI: http://eprints.lse.ac.uk/id/eprint/66233

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics