Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
From MaRDI portal
(Redirected from Publication:675058)
Recommendations
Cited in
(70)- Energy consumption of group search on a line
- Incremental medians via online bidding
- Rendezvous in planar environments with obstacles and unknown initial distance
- Online searching with turn cost
- Weighted group search on a line \& implications to the priority evacuation problem
- scientific article; zbMATH DE number 7559116 (Why is no real title available?)
- Bike assisted evacuation on a line
- Competitive Searching for a Line on a Line Arrangement.
- Linear rendezvous with asymmetric clocks
- Event-driven optimal control for a robotic exploration, pick-up and delivery problem
- Treasure evacuation with one robot on a disk
- Finding defectives on a line by random docking and interval group tests
- The expanding search ratio of a graph
- Pebble guided near optimal treasure hunt in anonymous graphs
- Overcoming probabilistic faults in disoriented linear search
- Search games: a review
- Deterministic treasure hunt in the plane with angular hints
- Best-of-both-worlds analysis of online search
- A water-filling primal-dual algorithm for approximating nonlinear covering problems
- Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs
- Linear search by a pair of distinct-speed robots
- A nearly tight lower bound for the \(d\)-dimensional cow-path problem
- Flood search under the California split rule.
- How unsplittable-flow-covering helps scheduling with job-dependent cost functions
- New algorithms for related machines with temporary jobs.
- Optimal Constructions of Hybrid Algorithms
- Extreme statistics of superdiffusive Lévy flights and every other Lévy subordinate Brownian motion
- Optimal circle search despite the presence of faulty robots
- Further connections between contract-scheduling and ray-searching problems
- Searching for a non-adversarial, uncooperative agent on a cycle
- Overcoming probabilistic faults in disoriented linear search
- Scheduling search procedures: The wheel of fortune
- Incremental facility location problem and its competitive algorithms
- scientific article; zbMATH DE number 4062645 (Why is no real title available?)
- Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract)
- The ultimate strategy to search on \(m\) rays?
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line
- Online search with a hint
- scientific article; zbMATH DE number 437569 (Why is no real title available?)
- On the two-dimensional cow search problem
- A near optimal algorithm for the extended cow-path problem in the presence of relative errors
- scientific article; zbMATH DE number 7561402 (Why is no real title available?)
- Online algorithms for searching and exploration in the plane
- Weighted online search
- Ranking hypotheses to minimize the search cost in probabilistic inference models
- The beachcombers' problem: walking and searching with mobile robots
- Online minimization knapsack problem
- A \(o(n)\)-competitive deterministic algorithm for online matching on a line
- Competitive search in symmetric trees
- Online search for a hyperplane in high-dimensional Euclidean space
- Byzantine fault tolerant symmetric-persistent circle evacuation
- Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling
- Impact of knowledge on the cost of treasure hunt in trees
- Linear Search with Terrain-Dependent Speeds
- Pebble guided optimal treasure hunt in anonymous graphs
- Algorithms for \(p\)-Faulty Search on a half-line
- Online facility assignment
- Multi-processor search and scheduling problems with setup cost
- Evacuating from \(\ell_p\) unit disks in the wireless model
- Greedy metric minimum online matchings with random arrivals
- Querying with Uncertainty
- The ANTS problem
- Optimal circle search despite the presence of faulty robots
- Wireless evacuation on \(m\) rays with \(k\) searchers
- Evacuation of equilateral triangles by mobile agents of limited communication range
- Infinite linear programming and online searching with turn cost
- Multi-target ray searching problems
- Better upper bounds for searching on a line with Byzantine robots
- Lower bounds for searching robots, some faulty
- Treasure hunt with advice
This page was built for publication: Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675058)
