Generalized Longest Simple Path Problems: Speeding up Search Using SPQR Trees

Gal Dahan, Itay Tabib, Solomon Eyal Shimony, Yefim Dinitz

Research output: Contribution to journalConference articlepeer-review

Abstract

The longest simple path and snake-in-a-box are combinatorial search problems of considerable research interest. Recent work has recast these problems as special cases of a generalized longest simple path (GLSP) framework, and showed how to generate improved search heuristics for them. The greatest reduction in search effort was based on SPQR tree rules, but it was posed as an open problem how to use them optimally. Unrelated to search, a theoretical paper on the existence of simple cycles that include three given edges answers such queries in linear time with SPQR trees. These theoretical results are utilized in this paper to develop advanced heuristics and search partitioning for GLSP. Empirical results on gridbased graphs show that these heuristics can result in orders of magnitude reduction in the number of expansions, as well as significantly reduced overall runtime in most cases.

Original languageEnglish
Pages (from-to)28-36
Number of pages9
JournalThe International Symposium on Combinatorial Search
Volume17
Issue number1
DOIs
StatePublished - 1 Jan 2024
Event17th International Symposium on Combinatorial Search, SoCS 2024 - Kananaskis, Canada
Duration: 6 Jun 20248 Jun 2024

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Generalized Longest Simple Path Problems: Speeding up Search Using SPQR Trees'. Together they form a unique fingerprint.

Cite this