Paradigms for Fast Parallel Approximability

DOI10.1017/CBO9780511666407zbMath0927.68120OpenAlexW1491295913MaRDI QIDQ4229814

Maria J. Serna, Josep Diaz, Paul G. Spirakis, Jacobo Toran

Publication date: 28 February 1999

Full work available at URL: https://doi.org/10.1017/cbo9780511666407

zbMATH Keywords

combinatorial optimization problemsextremal graph theoryroundingparallel random access machinesinterval partitioningseparation techniquesparallel approximability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Distributed algorithms (68W15)

Related Items (3)

A 2-approximation NC algorithm for connected vertex cover and tree cover ⋮ The approximability of non-Boolean satisfiability problems and restricted integer programming ⋮ On the parallel approximability of a subclass of quadratic programming.

This page was built for publication: Paradigms for Fast Parallel Approximability