Online Searching

References

• Alberts S. Competitive online algorithms, overview. Optima, Math. Programming Soc. Newsletter (1997) 54:1–8Google Scholar
• Ascheuer S., Gröetschel M., Rambau J., Kamin N. Combinatorial online optimization in practice. Optima, Math. Programming Soc. Newsletter (1988) 57:1–6Google Scholar
• Baeza-Yates R., Culberson J., Rawlins G. Searching in the plane. Inform. Computation (1993) 106:234–244Crossref, Google Scholar
• Bellman R. A minimization problem. Bull. Amer. Math. Soc. (1956) 62:270Crossref, Google Scholar
• Borodin A., EI-Yaniv Ran. Online Computation and Competitive Analysis (1998) (Cambridge University Press)Google Scholar
• Borodin A., Linial N., Saks M. An optimal on-line algorithm for metrical task systems. J. ACM (1992) 39:745–763Crossref, Google Scholar
• Foster D. P., Vohra R. Regret in the on-line decision problem. (1997) . Working paper, Department of Management Science, Ohio State University, Columbus, OHGoogle Scholar
• Gluss B. An alternative solution to the ‘lost at sea’ problem. Naval Res. Logistics Quart. (1961a) 8:117–128Crossref, Google Scholar
• Gluss B. The minimax path in a search for a circle in the plane. Naval Res. Logistics Quart. (1961b) 8:357–360Crossref, Google Scholar
• Hassin R., Tamir A. Minimal length curves that are not embeddable in an open planar set: The problem of a lost swimmer with a compass. SIAM J. Control and Optim. (1992) 30:695–703Crossref, Google Scholar
• Heyman D., Sobel M.Stochastic Models in Operations Research (1984) 2(Mc Graw-Hill)Google Scholar
• Isbell J. An optimal search pattern. Naval Res. Logistics Quart. (1957) 4:357–359Crossref, Google Scholar
• Jaillet P., Stafford M.Parallel on-line search (1997) . Working paper, MSIS Department, The University of Texas at Austin, Austin, TXGoogle Scholar
• Kao M., Reif J., Tate S. Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem. Proc. 4th Ann. ACM-SIAM Symp. on Discrete Algorithms (1993) 441–447Google Scholar
• Karlin A., Manasse M., Rudolph L., Sleator D. Competitive snoopy caching. Algorithmica (1988) 3:79–119Crossref, Google Scholar
• Manasse M., McGeoch L., Sleator D. Competitive algorithms for on-line problems. J. Algorithms (1990) 11:208–230Crossref, Google Scholar
• Papadimitriou C., Yannakakis M. Shortest paths without a map. Theoret. Comput. Sci. (1991) 84:127–150Crossref, Google Scholar
• Sleator D., Tarjan R. Amortized efficiency of list update and paging rules. Comm. ACM (1985) 28:202–208Crossref, Google Scholar