Binary Search in Graphs Revisited

Spirakis, PG ORCID: 0000-0001-5396-3749, Deligkas, A and mertzios, george (2018) Binary Search in Graphs Revisited. Algorithmica: an international journal in computer science, 81 (5). pp. 1757-1780.

This is the latest version of this item.

Access the full-text of this item by clicking on the Open Access link.

	Text ALGO-D-17-00293.pdf - Author Accepted Manuscript Download (602kB)
	Text binary-search-graphs-algorithmica_REVISED_310718.pdf - Author Accepted Manuscript Download (203kB)

Official URL: http://dx.doi.org/10.1007/s00453-018-0501-y

Abstract

In the classical binary search in a path the aim is to detect an unknown target by asking as few queries as possible, where each query reveals the direction to the target. This binary search algorithm has been recently extended by Emamjomeh-Zadeh et al. (in: Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC 2016, Cambridge, pp. 519–532, 2016) to the problem of detecting a target in an arbitrary graph. Similarly to the classical case in the path, the algorithm of Emamjomeh-Zadeh et al. maintains a candidates’ set for the target, while each query asks an appropriately chosen vertex—the “median”—which minimises a potential Φ among the vertices of the candidates’ set. In this paper we address three open questions posed by Emamjomeh-Zadeh et al., namely (a) detecting a target when the query response is a direction to an approximately shortest path to the target, (b) detecting a target when querying a vertex that is an approximate median of the current candidates’ set (instead of an exact one), and (c) detecting multiple targets, for which to the best of our knowledge no progress has been made so far. We resolve questions (a) and (b) by providing appropriate upper and lower bounds, as well as a new potential Γ that guarantees efficient target detection even by querying an approximate median each time. With respect to (c), we initiate a systematic study for detecting two targets in graphs and we identify sufficient conditions on the queries that allow for strong (linear) lower bounds and strong (polylogarithmic) upper bounds for the number of queries. All of our positive results can be derived using our new potential Γ that allows querying approximate medians.

Item Type:	Article
Uncontrolled Keywords:	Binary search, Graph, Approximate query, Probabilistic algorithm, Lower bound
Depositing User:	Symplectic Admin
Date Deposited:	03 Oct 2018 14:31
Last Modified:	19 Jan 2023 01:16
DOI:	10.1007/s00453-018-0501-y
Open Access URL:	http://dx.doi.org/10.1007/s00453-018-0501-y
Related URLs:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3026738