Years and Authors of Summarized Original Work
1993; Baeza-Yates, Culberson, Rawlins
2001; Jaillet, Stafford
Problem Definition
In the Linear Search Problem (LSP), we seek efficient strategies for locating an immobile target on the infinite line. More formally, the search environment consists of the infinite (i.e., unbounded) line, with a point O designated as a specific start point. A mobile searcher is initially located at O, whereas the target may be hidden at any point on the line. The searcher’s strategy S defines the movement of the searcher on the line; on the other hand, the hider’s strategy H is defined as the precise placement of the target on the line, and we denote by | H | the distance of the target from the start point. Given strategies S, H, the cost of locating the target, denoted by c(S, H) is the total distance traversed by the searcher at the first time the target is located. The normalized cost of the strategies is defined as the quantity \(\overline{c}(S,H) =...
This is a preview of subscription content, log in via an institution to check access.
Recommended Reading
Alpern S, Gal S (2003) The theory of search games and rendezvous. Kluwer Academic, Boston
Baeza-Yates R, Culberson J, Rawlins G (1993) Searching in the plane. Inf Comput 106(2):234–252
Beck A (1964) On the linear search problem. Naval Res Logist 2:221–228
Beck A, Newman DJ (1970) Yet more on the linear search problem. Isr J Math 8:419–429
Bernstein DS, Finkelstein L, Zilberstein S (2003) Contract algorithms and robots on rays: unifying two scheduling problems. In: Proceedings of the 18th international joint conference on artificial intelligence (IJCAI), Acapulco, pp 1211–1217
Bose P, De Carufel J, Durocher S (2013) Revisiting the problem of searching on a line. In: Proceedings of the 21st European symposium on algorithms (ESA), Sophia Antipolis, pp 205–216
Gal S (1972) A general search game. Isr J Math 12:34–45
Gal S (1974) Minimax solutions for linear search problems. SIAM J Appl Math 27:17–30
Jaillet P, Stafford M (2001) Online searching. Oper Res 49:501–515
Kirkpatrick DG (2009) Hyperbolic dovetailing. In: Proceedings of the 17th annual European symposium on algorithms (ESA), Copenhagen, pp 616–627
Koutsoupias E, Papadimitriou C, Yannakakis M (1996) Searching a fixed graph. In: Proceedings of the 23rd international colloquium on automata, languages, and programming (ICALP), Paderborn, pp 280–289
López-Ortiz A, Schuierer S (2001) The ultimate strategy to search on m rays. Theor Comput Sci 261(2):267–295
Schuierer S (2001) Lower bounds in online geometric searching. Comput Geom Theory Appl 18(1):37–53
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer Science+Business Media New York
About this entry
Cite this entry
Angelopoulos, S. (2015). Deterministic Searching on the Line. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-3-642-27848-8_106-2
Download citation
DOI: https://doi.org/10.1007/978-3-642-27848-8_106-2
Received:
Accepted:
Published:
Publisher Name: Springer, Boston, MA
Online ISBN: 978-3-642-27848-8
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering