Searching in the plane
From MaRDI portal
Publication:690242
DOI10.1006/inco.1993.1054zbMath0781.68044MaRDI QIDQ690242
Ricardo A. Baeza-Yates, Joseph C. Culberson, Gregory J. E. Rawlins
Publication date: 20 December 1993
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1dd4bdbcf99e69e0e2cbe1f52d39c40a809447d9
68P10: Searching and sorting
Related Items
LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS, Unnamed Item, Lower bounds in on-line geometric searching, The ultimate strategy to search on \(m\) rays?, Parallel searching on \(m\) rays, On-line single-server dial-a-ride problems, Agent search in uniform b-ary trees: Multiple goals and unequal costs, A competitive analysis of algorithms for searching unknown scenes, On-line path planning in an unknown polygonal environment, Scheduling search procedures: The wheel of fortune, Classifying the multi robot path finding problem into a quadratic competitive complexity class, Ranking hypotheses to minimize the search cost in probabilistic inference models, How to find a point on a line within a fixed distance, An improved approximation ratio for the minimum latency problem, Agent searching in a tree and the optimality of iterative deepening, Searching with mobile agents in networks with liars., Flood search under the California split rule., Searching and on-line recognition of star-shaped polygons., Online matching on a line, Optimal robot localization in trees, The power of a pebble: Exploring and mapping directed graphs, A correction to: ``Agent searching in a tree and the optimality of iterative deepening, On-line parallel heuristics, processor scheduling and robot searching under the competitive framework, Competitive online routing in geometric graphs, The weighted 2-server problem, Parallel searching in the plane, Competitive distributed decision-making, Online searching with turn cost, Competitive Algorithms for Layered Graph Traversal
