Bidirectional Search for Longest Paths: Case for Front-to-Front Heuristics

arXiv:2606.05956v1 Announce Type: new Abstract: Bidirectional heuristic search can potentially reduce search effort for problems amenable to backward search. Therein, it is well-known that front-to-front heuristics can reduce the number of node expansions, but their overhead is so high that overall runtime almost always increases. We propose...

Läs hela artikeln hos källan.