Searching for an axis-parallel shoreline

DOI10.1016/j.tcs.2011.12.069zbMath1286.68468OpenAlexW2025158214MaRDI QIDQ443717

Elmar Langetepe

Publication date: 13 August 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.069

zbMATH Keywords

search gamescombinatorial optimizationcompetitive analysisonline algorithmtwo-sequence functionals

Mathematics Subject Classification ID

Applications of game theory (91A80) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Online algorithms; streaming algorithms (68W27)

Related Items

Pebble guided optimal treasure hunt in anonymous graphs, Improved Lower Bounds for Shoreline Search, Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs, Impact of knowledge on the cost of treasure hunt in trees, Deterministic treasure hunt in the plane with angular hints, Unnamed Item, Reaching a target in the plane with no information, Advice complexity of treasure hunt in geometric terrains, Pebble guided near optimal treasure hunt in anonymous graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Searching in the plane
• On the two-dimensional cow search problem
• Online algorithms. The state of the art
• Search games
• How to find a point on a line within a fixed distance
• The theory of search games and rendezvous.
• On the Optimality of the Exponential Functions for Some Minimax Problems
• Experimental and Efficient Algorithms
• Lower bounds in on-line geometric searching
• The ultimate strategy to search on \(m\) rays?