Randomized parallel algorithms for backtrack search and branch-and-bound computation
From MaRDI portal
Publication:3140025
DOI10.1145/174130.174145zbMath0789.68066OpenAlexW2012223233MaRDI QIDQ3140025
Yan-Jun Zhang, Richard M. Karp
Publication date: 23 June 1994
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/174130.174145
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Distributed algorithms (68W15)
Related Items (17)
Efficient randomized load distribution for tree structured computations on parallel and distributed computer systems ⋮ Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method ⋮ Analysis of randomized load distribution for reproduction trees in linear arrays and rings ⋮ Parallel algorithms for a multi-level network optimization problem ⋮ A review of literature on parallel constraint solving ⋮ Optimal \((v,5,2,1)\) optical orthogonal codes of small \(v\) ⋮ On the efficiency of localized work stealing ⋮ Architecture independent parallel selection with applications to parallel priority queues ⋮ Space-efficient scheduling of stochastically generated tasks ⋮ Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks ⋮ Branch and bound on the network model ⋮ Deterministic parallel backtrack search ⋮ The scalability analysis of a parallel tree search algorithm ⋮ DETERMINISTIC BRANCH-AND-BOUND ON DISTRIBUTED MEMORY MACHINES ⋮ A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES ⋮ PARSSSE: AN ADAPTIVE PARALLEL STATE SPACE SEARCH ENGINE ⋮ Upper bounds on number of steals in rooted trees
This page was built for publication: Randomized parallel algorithms for backtrack search and branch-and-bound computation
