Search algorithms at ACM contests

MaRDI QIDQ5851881zbMATH OpenFDO

Authors Márk Kósa, János Pánovics

Publication date 25 January 2010

zbMATH Keywords

ACM contestbacktrackingbreadth-first searchsearch algorithmsstate space representationuniform-cost search

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 193404
• Heuristic search and related boundary value problems
• Depth-first iterative-deepening: An optimal admissible tree search
• Learning heuristics in search problems
• Breadth-first heuristic search

Cited in

(1)

• The algorithm selection competitions 2015 and 2017

This page was built for publication: Search algorithms at ACM contests

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