Competitive search in symmetric trees

DOI10.1007/978-3-642-22300-6_47MaRDI QIDQ5199273zbMATH OpenOpenAlexFDO

Authors Sandra Zilles, David Kirkpatrick

Publication date 12 August 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22300-6_47

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

Recommendations

• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• scientific article; zbMATH DE number 437569
• Competitive search in a network
• Online Searching
• On the tree search problem with non-uniform costs

Cited in

(6)

• Multi-processor search and scheduling problems with setup cost
• Online Searching
• Competitive Online Search Trees on Trees
• Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs
• Impact of knowledge on the cost of treasure hunt in trees
• Almost-optimal deterministic treasure hunt in arbitrary graphs

This page was built for publication: Competitive search in symmetric trees

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