Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Find-and-Fetch Search on a Tree

From MaRDI portal
Publication:2879521
Jump to:navigation, search

DOI10.1287/opre.1110.0966zbMath1233.91046OpenAlexW2064463888WikidataQ126111558 ScholiaQ126111558MaRDI QIDQ2879521

Steven Alpern

Publication date: 26 March 2012

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: http://or.journal.informs.org/


zbMATH Keywords

game theorynetworks/graphs, tree algorithmssearch and surveillance


Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)


Related Items (11)

The search and rescue game on a cycle ⋮ On the approximation ratio of the random Chinese postman tour for network search ⋮ Search Games for an Immobile Hider ⋮ Treasure evacuation with one robot on a disk ⋮ Search-and-rescue rendezvous ⋮ A new approach to Gal's theory of search games on weakly Eulerian networks ⋮ Weighted network search games with multiple hidden objects and multiple search teams ⋮ Search for an immobile hider on a stochastic network ⋮ Approximate solutions for expanding search games on general networks ⋮ Searching a Variable Speed Network ⋮ Search for an immobile hider in a known subset of a network




This page was built for publication: Find-and-Fetch Search on a Tree

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2879521&oldid=15836118"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 20:31.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki