@inproceedings{a8f458f95f874b3fbd570c23e922fb27,
title = "Solving the target-value search problem",
abstract = "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.",
author = "L{\'o}pez, {Carlos Linares} and Roni Stern and Ariel Felner",
note = "Publisher Copyright: Copyright c 2014, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 7th Annual Symposium on Combinatorial Search, SoCS 2014 ; Conference date: 15-08-2014 Through 17-08-2014",
year = "2014",
month = jan,
day = "1",
language = "الإنجليزيّة",
series = "Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014",
pages = "202--203",
editor = "Stefan Edelkamp and Roman Bartak",
booktitle = "Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014",
}