Optimal Constructions of Hybrid Algorithms
From MaRDI portal
Publication:4217305
DOI10.1006/jagm.1998.0959zbMath0919.68023arXivcs/0101028OpenAlexW2027345534MaRDI QIDQ4217305
Yiqun Yin, Yuan Ma, Michael Sipser, Ming-Yang Kao
Publication date: 23 August 1999
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0101028
Related Items (20)
Further connections between contract-scheduling and ray-searching problems ⋮ Querying with Uncertainty ⋮ Multi-processor search and scheduling problems with setup cost ⋮ Competitive search in a network ⋮ Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling ⋮ Weighted online search ⋮ A nearly tight lower bound for the \(d\)-dimensional cow-path problem ⋮ Search Games: A Review ⋮ Online search with a hint ⋮ Online algorithms for searching and exploration in the plane ⋮ Treasure evacuation with one robot on a disk ⋮ Multi-target ray searching problems ⋮ Lower bounds for searching robots, some faulty ⋮ The expanding search ratio of a graph ⋮ Infinite linear programming and online searching with turn cost ⋮ Lower bounds in on-line geometric searching ⋮ The ultimate strategy to search on \(m\) rays? ⋮ Parallel searching on \(m\) rays ⋮ Wireless evacuation on \(m\) rays with \(k\) searchers ⋮ Ranking hypotheses to minimize the search cost in probabilistic inference models
This page was built for publication: Optimal Constructions of Hybrid Algorithms
