Solving the target-value search problem

Carlos Linares López, Roni Stern, Ariel Felner

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations


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.

Original languageEnglish
Title of host publicationProceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014
EditorsStefan Edelkamp, Roman Bartak
PublisherAAAI press
Number of pages2
ISBN (Electronic)9781577356769
StatePublished - 2014
Externally publishedYes
Event7th Annual Symposium on Combinatorial Search, SoCS 2014 - Prague, Czech Republic
Duration: 15 Aug 201417 Aug 2014

Publication series

NameProceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014


Conference7th Annual Symposium on Combinatorial Search, SoCS 2014
Country/TerritoryCzech Republic

Bibliographical note

Publisher Copyright:
Copyright c 2014, Association for the Advancement of Artificial Intelligence ( All rights reserved.


Dive into the research topics of 'Solving the target-value search problem'. Together they form a unique fingerprint.

Cite this