A Simpler Analysis of the Karp-Zhang Parallel Branch-and-Bound Method

Authors:
Abhiram Ranade
Affiliations:
-
Venue:
A Simpler Analysis of the Karp-Zhang Parallel Branch-and-Bound Method
Year:
1990

Citing 0
Cited 6

Optimal speedup for backtrack search on a butterfly network

SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
An atomic model for message-passing

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Randomized parallel algorithms for backtrack search and branch-and-bound computation

Journal of the ACM (JACM)
A coding theorem for distributed computation

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Deterministic parallel backtrack search

Theoretical Computer Science
Partially ordered distributed computations on asynchronous point-to-point networks

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Karp and Zhang presented a general method for deriving randomized parallel branch-and-boxed algorithms from sequential ones. They showed that with high probability the resulting algorithms attained optimal speedup to within a constant: factor, for large enough problems. We present an alternate analysis of their method. Our analysis is considerably simpler, and gives good bounds even for small problem sizes.