Solving the Target-Value Search Problem
暂无分享,去创建一个
This paper addresses the Target-Value Search (TVS) problem, which is the problem of finding a path between two nodes in a graph whose cost is as close as possible to a given target value, T . This problem has been previously addressed: first, for directed acyclic graphs; second, for general graphs under the assumption that nodes can be revisited given that the same edge can not be traversed twice. In this work we focus on a more restrictive variant of the same problem where nodes can not be revisited. We prove that this variant is NP-complete and discuss novel theoretical properties and provide empirical results to solve this problem optimally.
[1] Johan de Kleer,et al. to SOCS ’ 09 1 A depth-first approach to target-value search , 2009 .
[2] Roni Stern,et al. Target-Value Search Revisited , 2013, IJCAI.
[3] J. Kleer,et al. Heuristic Search for Target-Value Path Problem , 2008 .