Online Searching

We consider the problem of searching m branches which, with the exception of a common source s, are disjoint hereafter called concurrent branches. A searcher, starting at s, must find a given “exit” t whose location, unknown to the searcher, is on one of the m branches. The problem is to find a strategy that minimizes the worst-case ratio between the total distance traveled and the length of the shortest path from s to t. Additional information may be available to the searcher before he begins his search. In addition to finding optimal or near optimal deterministic online algorithms for these problems, this paper addresses the “value” of getting additional information before starting the search.

[1]  Lyle A. McGeoch,et al.  Competitive algorithms for on-line problems , 1988, STOC '88.

[2]  Martin Grötschel,et al.  Combinatorial Online Optimization in Practice , 1998 .

[3]  Richard Bellman,et al.  Review: E. A. Coddington and N. Levinson, Theory of differential equations , 1956 .

[4]  Ricardo A. Baeza-Yates,et al.  Searching in the Plane , 1993, Inf. Comput..

[5]  M. Goldberg.  A Minimization Problem , 1981 .

[6]  J. R. Isbell.  An optimal search pattern , 1957 .

[8]  B. Gluss.  An alternative solution to the “lost at sea” problem , 1961 .

[9]  Daniel P. Heyman,et al.  Stochastic models in operations research , 1982 .

[10]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[11]  Jeffrey Shallit.  A Minimization Problem , 1994, SIAM Rev..

[12]  B. Gluss.  The minimax path in a search for a circle in a plane , 1961 .

[13]  Ming-Yang Kao,et al.  Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem , 1996, SODA '93.

[14]  Refael Hassin,et al.  Minimal length curves that are not embeddable in an open planar set: the problem of a lost swimmer with a compass , 1992 .

[15]  Dean P. Foster,et al.  Regret in the On-Line Decision Problem , 1999 .

[16]  Lyle A. McGeoch,et al.  Competitive Algorithms for Server Problems , 1990, J. Algorithms.

[17]  Allan Borodin,et al.  An optimal on-line algorithm for metrical task system , 1992, JACM.

[18]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[19]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[20]  Anna R. Karlin,et al.  Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).