Non-adaptive and adaptive two-sided search with fast objects

DOI10.1142/S0129054124500023MaRDI QIDQ6660956zbMATH OpenFDO

Authors A. V. Lebedev, Christian Deppe

Publication date 10 January 2025

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054124500023

zbMATH Keywords

adaptive searchcoding with feedbacksearch problemstwo-sided search

Mathematics Subject Classification ID

Graph theory (05Cxx) Theory of data (68Pxx) Game theory (91Axx)

Recommendations

• Optimal strategies for a model of combinatorial two-sided search
• A Combinatorial Model of Two-Sided Search
• A combinatorial model of two-sided search
• ON THE PROBLEM OF SEARCH WITH SHIPS AND AIRCRAFT
• scientific article; zbMATH DE number 7033647

Cites work

• A Combinatorial Model of Two-Sided Search
• Fault-tolerant search algorithms. Reliable computation with unreliable information
• Finding a princess in a palace: a pursuit-evasion problem
• How many lions are needed to clear a grid?
• How to hunt an invisible rabbit on a graph
• scientific article; zbMATH DE number 41347 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3997549 (Why is no real title available?)
• scientific article; zbMATH DE number 823957 (Why is no real title available?)
• Optimal strategies for a model of combinatorial two-sided search
• Search for a moving target in a graph
• Searching for an intruder on graphs and their subdivisions
• Searching games with errors -- fifty years of coping with liars
• The complexity of zero-visibility cops and robber
• Theory of optimal search

This page was built for publication: Non-adaptive and adaptive two-sided search with fast objects

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