Online Searching

DOI10.1287/OPRE.49.4.501.11227MaRDI QIDQ3635018zbMATH OpenOpenAlexFDO

Authors Patrick Jaillet, Matthew Stafford

Publication date 3 July 2009

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/4b94d5ec44b74d4c7270f1fb0c13e93fd505a734

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Search theory (90B40) Programming involving graphs or networks (90C35)

Recommendations

• Competitive Online Approximation of the Optimal Search Ratio
• Algorithms – ESA 2004
• Online searching with turn cost
• Competitive search in symmetric trees
• scientific article; zbMATH DE number 4062645

Cited in

(13)

• Flood search under the California split rule.
• Online scheduling problems with flexible release dates: applications to infrastructure restoration
• Linear search by a pair of distinct-speed robots
• Online routing and searching on graphs with blocked edges
• Online failure diagnosis in interdependent networks
• Weighted online minimum latency problem with edge uncertainty
• Online searching with an autonomous robot
• Online searching with turn cost
• Linear search by a pair of distinct-speed robots
• Online Vehicle Routing Problems: A Survey
• Competitive search in symmetric trees
• Wireless evacuation on \(m\) rays with \(k\) searchers
• Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions

This page was built for publication: Online Searching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3635018)