Online routing and searching on graphs with blocked edges

We study routing and searching decisions of a search-and-detection (SDT) team on a road network under online uncertainty setting. Given an undirected edge-weighted bounded graph, a static target is positioned at an unknown vertex among potential target vertices in the graph. A non-negative search co...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of combinatorial optimization 2022-09, Vol.44 (2), p.1039-1059
Hauptverfasser:	Shiri, Davood, Tozan, Hakan
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Combinatorics Convex and Discrete Geometry Cost analysis Graph theory Lower bounds Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Roads Searching Target detection Theory of Computation Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!