On the linear search problem

From MaRDI portal
Publication:2530990

DOI10.1007/BF02759737zbMath0168.39502MaRDI QIDQ2530990

Anatole Beck

Publication date: 1964

Published in: Israel Journal of Mathematics (Search for Journal in Brave)




Related Items (73)

Linear Search with Terrain-Dependent SpeedsThe linear search problem rides againBike assisted evacuation on a lineLower bounds in on-line geometric searching metric searchingQuerying with UncertaintySearching for a Non-adversarial, Uncooperative Agent on a CycleGeneralizations in the linear search problemEvacuating from \(\ell_p\) unit disks in the wireless model (extended abstract)Dynamic programming and the backpacker's linear search problemMulti-processor search and scheduling problems with setup costEvacuating an Equilateral Triangle in the Face-to-Face ModelGod save the queenOnline search for a hyperplane in high-dimensional Euclidean spaceEvacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)Search and delivery man problems: when are depth-first paths optimal?Evacuating two robots from multiple unknown exits in a circleBest-of-both-worlds analysis of online searchAlmost-Optimal Deterministic Treasure Hunt in Unweighted GraphsEvacuating from \(\ell_p\) unit disks in the wireless modelImpact of knowledge on the cost of treasure hunt in treesThe beachcombers' problem: walking and searching with mobile robotsOptimal multiplicative generalized linear search plan for a discrete random walkerTriangle evacuation of 2 agents in the wireless model (extended abstract)Search on a Line by Byzantine RobotsWeighted online searchSearch and rescue on the lineOvercoming probabilistic faults in disoriented linear searchOptimal circle search despite the presence of faulty robotsSearch Games: A ReviewSearch Games for an Immobile HiderDelivery to safety with two cooperating robotsAlgorithms for \(p\)-Faulty Search on a half-lineOnline search with a hintEvacuating equilateral triangles and squares in the face-to-face modelPriority evacuation from a disk: the case of \(n \geq 4\)Multiplicative linear search for a Brownian target motionOnline algorithms for searching and exploration in the planeTreasure evacuation with one robot on a diskMulti-target ray searching problemsBetter Upper Bounds for Searching on a Line with Byzantine RobotsLower bounds for searching robots, some faultyThe expanding search ratio of a graphInfinite linear programming and online searching with turn costLinear search by a pair of distinct-speed robotsLower bounds in on-line geometric searchingMinimizing the average searching time for an object within a graphSearch on a line with faulty robotsSon of the linear search problemUnnamed ItemSearching for the Random Walking microorganism cellsFast two-robot disk evacuation with wireless communicationOnline searching with turn costWireless evacuation on \(m\) rays with \(k\) searchersBeachcombing on strips and islandsSearching for a non-adversarial, uncooperative agent on a cyclePriority evacuation from a disk: the case of \(n = 1,2,3\)Time-energy tradeoffs for evacuation by two robots in the wireless modelStar search -- a different showMore on the linear search problemLinear rendezvous with asymmetric clocksYet more on the linear search problemEnergy Consumption of Group Search on a LineExploration of High-Dimensional Grids by Finite AutomataCoordinated search for an object hidden on the lineRendezvous search on the line with bounded resources: Expected time minimizationA generalization of Lévy's concentration-variance inequalityLinear Search by a Pair of Distinct-Speed RobotsThe return of the linear search problemOn the minimality of search paths under absolutely continuous univariate distributionsOptimal search paths for random variablesWeighted group search on a line \& implications to the priority evacuation problemGraph exploration by energy-sharing mobile agentsTwo-agent tree evacuation




This page was built for publication: On the linear search problem