A criterion of optimality of some parallelization scheme for backtrack search problem in binary trees

DOI10.1007/978-3-030-38603-0_33zbMATH Open1477.90041OpenAlexW3000423763MaRDI QIDQ1982929FDOQ1982929

M. A. Posypkin, Roman Kolpakov

Publication date: 14 September 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-38603-0_33

Recommendations

• Deterministic parallel backtrack search
• scientific article; zbMATH DE number 2102781
• Space-Efficient Parallel Algorithms for Combinatorial Search Problems
• Optimal speedup for backtrack search on a butterfly network
• Branch-and-bound and backtrack search on mesh-connected arrays of processors

zbMATH Keywords

complexity analysisbacktrack searchparallel tree search

Mathematics Subject Classification ID

Integer programming (90C10)

Cited In (4)

• Deterministic parallel backtrack search
• On the best choice of a branching variable in the subset sum problem
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: A criterion of optimality of some parallelization scheme for backtrack search problem in binary trees

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