Approximation and complexity of multi-target graph search and the Canadian traveler problem.
Martijn van EeRené SittersPublished in: Theor. Comput. Sci. (2018)
Keyphrases
- graph search
- multi target
- multi target tracking
- duplicate detection
- search algorithm
- multi sensor
- computational complexity
- search problems
- depth first search
- shortest path
- visual tracking
- heuristic search
- tree search
- worst case
- search methods
- data association
- memory efficient
- graph databases
- multiple targets
- np hard
- machine learning