Online searching with turn cost
Theoretical Computer Science - Approximation and online algorithms
Resource Allocation Policies for Personalization in Content Delivery Sites
Information Systems Research
Multi-target ray searching problems
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Flood search under the California Split rule
Operations Research Letters
| Hi-index | 0.00 |
We consider the problem of searchingm branches which, with the exception of a common sources, are disjoint (hereafter called concurrent branches). A searcher, starting ats, must find a given "exit"t whose location, unknown to the searcher, is on one of them branches. The problem is to find a strategy that minimizes the worst-case ratio between the total distance traveled and the length of the shortest path froms tot. Additional information may be available to the searcher before he begins his search.In addition to finding optimal or near optimal deterministic online algorithms for these problems, this paper addresses the "value" of getting additional information before starting the search.