## 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 - 2014 |

Externally published | Yes |

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 |

### Bibliographical note

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