Finding optimal solutions to Atomix

DOI10.1007/3-540-45422-5_17MaRDI QIDQ4797430zbMATH OpenFDO

Authors Falk Hüffner, Stefan Edelkamp, Henning Fernau, Rolf Niedermeier

Publication date 13 March 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2174/21740229.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Assembling molecules in ATOMIX is hard
• Depth-first iterative-deepening: An optimal admissible tree search
• Heuristic search in restricted memory
• Linear-time disk-based implicit graph search
• On the asymptotic performance of IDA

Cited in

(3)

• Assembling molecules in ATOMIX is hard
• The Max-Atom Problem and Its Relevance
• Generalized Pete's Pike is PSPACE-complete

This page was built for publication: Finding optimal solutions to Atomix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4797430)