On the approximation ratio of the Random Chinese Postman Tour for network search
Year of publication: |
16 December 2017
|
---|---|
Authors: | Lidbetter, Thomas |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 263.2017, 3 (16.12.), p. 782-788
|
Subject: | Game theory | Search games | Chinese Postman Tour | Networks | Spieltheorie | China | Netzwerk | Network | Soziales Netzwerk | Social network | Tourenplanung | Vehicle routing problem | Suchtheorie | Search theory |
-
Competitive search in a network
Angelopoulos, Spyros, (2020)
-
Efficient partnership formation in networks
Bloch, Francis, (2019)
-
Weighted network search games with multiple hidden objects and multiple search teams
Yolmeh, Abdolmajid, (2021)
- More ...
-
Mining Coal or Finding Terrorists: The Expanding Search Paradigm
Alpern, Steve, (2013)
-
Optimal patrolling strategies for trees and complete networks
Thuy Bui, (2023)
-
Searching a variable speed network
Alpern, Steve, (2014)
- More ...