Yet more on the linear search problem
From MaRDI portal
Publication:2543566
DOI10.1007/BF02798690zbMath0209.20303MaRDI QIDQ2543566
Anatole Beck, Donald J. Newman
Publication date: 1970
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Related Items (55)
Collaboration Without Communication: Evacuating Two Robots from a Disk ⋮ The linear search problem rides again ⋮ Lower bounds in on-line geometric searching metric searching ⋮ Further connections between contract-scheduling and ray-searching problems ⋮ Generalizations in the linear search problem ⋮ A competitive search game with a moving target ⋮ Multi-processor search and scheduling problems with setup cost ⋮ Online routing and searching on graphs with blocked edges ⋮ Online search for a hyperplane in high-dimensional Euclidean space ⋮ Pebble guided optimal treasure hunt in anonymous graphs ⋮ On-line load balancing for related machines ⋮ Competitive search in a network ⋮ Almost universal anonymous rendezvous in the plane ⋮ Best-of-both-worlds analysis of online search ⋮ Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs ⋮ Impact of knowledge on the cost of treasure hunt in trees ⋮ Optimal multiplicative generalized linear search plan for a discrete random walker ⋮ Search on a Line by Byzantine Robots ⋮ Weighted online search ⋮ Overcoming probabilistic faults in disoriented linear search ⋮ A nearly tight lower bound for the \(d\)-dimensional cow-path problem ⋮ Search Games: A Review ⋮ Online search with a hint ⋮ Rendezvous search when marks are left at the starting points ⋮ Deterministic treasure hunt in the plane with angular hints ⋮ Multiplicative linear search for a Brownian target motion ⋮ Online algorithms for searching and exploration in the plane ⋮ Multi-target ray searching problems ⋮ Search for an immobile entity on a network ⋮ Network search games with immobile hider, without a designated searcher starting point ⋮ Better Upper Bounds for Searching on a Line with Byzantine Robots ⋮ Lower bounds for searching robots, some faulty ⋮ The expanding search ratio of a graph ⋮ Infinite linear programming and online searching with turn cost ⋮ Searching for multiple objects in multiple locations ⋮ Lower bounds in on-line geometric searching ⋮ Search on a line with faulty robots ⋮ Son of the linear search problem ⋮ LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS ⋮ Unnamed Item ⋮ Searching for the Random Walking microorganism cells ⋮ Unnamed Item ⋮ Online searching with turn cost ⋮ Hide and seek in a subset of the real line ⋮ Wireless evacuation on \(m\) rays with \(k\) searchers ⋮ Search for an immobile hider on a stochastic network ⋮ Star search -- a different show ⋮ Linear rendezvous with asymmetric clocks ⋮ Competitive Searching for a Line on a Line Arrangement. ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ A general search game ⋮ On the minimality of search paths under absolutely continuous univariate distributions ⋮ New algorithms for related machines with temporary jobs. ⋮ Optimal search paths for random variables ⋮ Pebble guided near optimal treasure hunt in anonymous graphs
Cites Work
This page was built for publication: Yet more on the linear search problem
