26/10/2020

Solving the Longest Simple Path Problem with Heuristic Search

Yossi Cohen, Roni Stern, Ariel Felner

Keywords: Heuristic Search, Longest Simple Path, Admissible Heuristics

Abstract Paper Similar Papers

Abstract: Prior approaches for finding the longest simple path (LSP) in a graph used constraints solvers and genetic algorithms. In this work, we solve the LSP problem with heuristic search. We first introduce several methods for pruning dominated path prefixes. Then, we propose several admissible heuristic functions for this problem. Experimental results demonstrate the large impact of the proposed heuristics and pruning rules.

 0
 0
 0
 0
  Share    
This is an embedded video. Talk and the respective paper are published at ICAPS 2020 virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment
no comments yet
code of conduct: tbd Characters remaining: 140

Similar Papers

 0
 0
 0
 0
 13:43 
 0
 0
 0
 0
 7:32 
 0
 0
 0
 0
 15:48 
 0
 0
 0
 0
 11:53 
 0
 0
 0
 0
 13:48 
 0
 0
 0
 0
 5:11 
 0
 0
 0
 0
 19:52 
 0
 0
 0
 0
 7:06 
 0
 0
 0
 0
 17:35 
 0
 0
 0
 0
 15:39 
 0
 0
 0
 0
 13:18 
 0
 0
 0
 0
 14:26 
 0
 0
 0
 0
 11:17 
 0
 0
 0
 0
 13:07 
 0
 0
 0
 0
 14:16 
 0
 0
 0
 0
 7:49 
 0
 0
 0
 0
 11:06 
 0
 0
 0
 0
 5:01 
 0
 0
 0
 0
 5:12 
 0
 0
 0
 0
 13:24 
 0
 0
 0
 0
 3:06 
 0
 0
 0
 0
 14:25 
 0
 0
 0
 0
 9:39 
 0
 0
 0
 0
 13:39 
 0
 0
 0
 0
 12:17 
 0
 0
 0
 0
 3:11 
 0
 0
 0
 0
 16:21 
 0
 0
 0
 0
 5:15 
 0
 0
 0
 0
 16:07 
 0
 0
 0
 0
 21:34 
 0
 0
 0
 0
 8:47 
 0
 0
 0
 0
 5:16 
 0
 0
 0
 0
 17:33 
 0
 0
 0
 0
 5:17 
 0
 0
 0
 1
 4:57 
 0
 0
 0
 0
 13:57 
 0
 0
 0
 0
 20:49 
 0
 0
 0
 0
 5:03 
 0
 0
 0
 0
 5:12 
 0
 0
 0
 0
 12:43