Design and research of the parallel combinatorial algorithms

MaRDI QIDQ5146090zbMATH OpenFDO

Authors N. E. Timoshevskaya

Publication date 25 January 2021

Full work available at URL http://mathnet.ru/eng/pdm63

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 2100400
• Parallel processing for difficult combinatorial optimization problems
• Implementation algorithms for solution of covering problems and analysis of their efficiency
• Parallel and serial heuristics for the minimum set cover problem
• scientific article; zbMATH DE number 4037239

Cited in

(3)

• Design of parallel algorithms for the single resource allocation problem
• Space-Efficient Parallel Algorithms for Combinatorial Search Problems
• scientific article; zbMATH DE number 7300332 (Why is no real title available?)

This page was built for publication: Design and research of the parallel combinatorial algorithms

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