scientific article; zbMATH DE number 934538

MaRDI QIDQ4895237zbMATH OpenFDO

Authors Luděk Kučera, Andrea Clementi, José Rolim

Publication date 22 January 1997

zbMATH Keywords

combinatorial optimizationparallel algorithmsrandom graphssingle-sourceshortest paths in graphsall-pairs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Combinatorial optimization (90C27)

Recommendations

• Parallel Greedy Randomized Adaptive Search Procedures
• Publication:4953917
• Parallel randomized best-first minimax search.
• A randomized parallel backtracking algorithm
• scientific article; zbMATH DE number 1302200
• scientific article; zbMATH DE number 1304350
• scientific article; zbMATH DE number 1014712
• Efficiency of randomized parallel backtrack search
• Parallel strategies for direct multisearch

Cited in

(9)

• scientific article; zbMATH DE number 1863286 (Why is no real title available?)
• Graph algorithms with small communication costs
• A sharper analysis of a prallel algorithm for the all pairs shortest path problem
• Evaluation of a simple, scalable, parallel best-first search strategy
• High-Probability Parallel Transitive-Closure Algorithms
• One side cut accelerated random search
• Parallel exhaustive search without coordination
• Parallel strategies for direct multisearch
• The parallel complexity of approximating the high degree subgraph problem

This page was built for publication:

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