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

all-pairscombinatorial optimizationparallel algorithmsrandom graphsshortest paths in graphssingle-source

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(15)

• The parallel complexity of approximating the high degree subgraph problem
• Graph algorithms with small communication costs
• One side cut accelerated random search
• Parallel strategies for direct multisearch
• High-Probability Parallel Transitive-Closure Algorithms
• Evaluation of a simple, scalable, parallel best-first search strategy
• A parallelization of Dijkstra's shortest path algorithm
• Time–Work Tradeoffs of the Single-Source Shortest Paths Problem
• Randomized parallel algorithms
• -stepping: A parallel single source shortest path algorithm
• scientific article; zbMATH DE number 1334210 (Why is no real title available?)
• A Randomized Parallel Algorithm for Single-Source Shortest Paths
• scientific article; zbMATH DE number 1863286 (Why is no real title available?)
• Parallel exhaustive search without coordination
• A sharper analysis of a prallel algorithm for the all pairs shortest path 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)