Parallel approximation of optimization problems
From MaRDI portal
Publication:6560202
Cites work
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- A fast parallel algorithm for the maximal independent set problem
- A parallel approximation algorithm for positive linear programming
- A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- Approximation algorithms for combinatorial problems
- Approximation algorithms for NP-complete problems on planar graphs
- scientific article; zbMATH DE number 4155879 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256703 (Why is no real title available?)
- scientific article; zbMATH DE number 1142306 (Why is no real title available?)
- scientific article; zbMATH DE number 2077132 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 784042 (Why is no real title available?)
- On a set of almost deterministic k-independent random variables
- On the structure of linear graphs
- Optimization, approximation, and complexity classes
- Parallel computation and conflicts in memory access
- Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems
This page was built for publication: Parallel approximation of optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560202)