Solving the target-value search problem

Carlos Linares López; Roni Stern; Ariel Felner

Solving the target-value search problem

Carlos Linares López, Roni Stern, Ariel Felner

Department of Software and Information Systems Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

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.

Original language	English
Title of host publication	Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014
Editors	Stefan Edelkamp, Roman Bartak
Publisher	AAAI press
Pages	202-203
Number of pages	2
ISBN (Electronic)	9781577356769
State	Published - 1 Jan 2014
Event	7th Annual Symposium on Combinatorial Search, SoCS 2014 - Prague, Czech Republic Duration: 15 Aug 2014 → 17 Aug 2014

Publication series

Name	Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014
Volume	2014-January

Conference

Conference	7th Annual Symposium on Combinatorial Search, SoCS 2014
Country/Territory	Czech Republic
City	Prague
Period	15/08/14 → 17/08/14

ASJC Scopus subject areas

Computer Networks and Communications

Cite this

@inproceedings{9d98ae17e5394d47bf5721f325050c95,

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 = "English",

series = "Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014",

publisher = "AAAI press",

pages = "202--203",

editor = "Stefan Edelkamp and Roman Bartak",

booktitle = "Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014",

}

López, CL, Stern, R & Felner, A 2014, Solving the target-value search problem. in S Edelkamp & R Bartak (eds), Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014. Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014, vol. 2014-January, AAAI press, pp. 202-203, 7th Annual Symposium on Combinatorial Search, SoCS 2014, Prague, Czech Republic, 15/08/14.

Solving the target-value search problem. / López, Carlos Linares; Stern, Roni ; Felner, Ariel.
Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014. ed. / Stefan Edelkamp; Roman Bartak. AAAI press, 2014. p. 202-203 (Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014; Vol. 2014-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Solving the target-value search problem

AU - López, Carlos Linares

AU - Stern, Roni

AU - Felner, Ariel

PY - 2014/1/1

Y1 - 2014/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85045419180&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:85045419180

T3 - Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014

SP - 202

EP - 203

BT - Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014

A2 - Edelkamp, Stefan

A2 - Bartak, Roman

PB - AAAI press

T2 - 7th Annual Symposium on Combinatorial Search, SoCS 2014

Y2 - 15 August 2014 through 17 August 2014

ER -

Solving the target-value search problem

Abstract

Publication series

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this