Parallel computing in combinatorial optimization | Zendy

G.A.P. Kindervater | Zendy; Jan Karel Lenstra | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Parallel computing in combinatorial optimization

Author(s) -

G.A.P. Kindervater,

Jan Karel Lenstra

Publication year - 1988

Publication title -

annals of operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.068

H-Index - 105

eISSN - 1572-9338

pISSN - 0254-5330

DOI - 10.1007/bf02186483

Subject(s) - theory of computation , computer science , parallelism (grammar) , computation , parallel algorithm , theoretical computer science , parallel computing , analysis of parallel algorithms , combinatorial optimization , algorithm

This is a review of the literature on parallel computers and algorithms that is relevant for combinatorial optimization. We start by describing theoretical as well as realistic machine models for parallel computations. Next, we deal with the complexity theory for parallel computations and illustrate the resulting concepts by presenting a number of polylog parallel algorithms and

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research