Parallel approximation of optimization problems
From MaRDI portal
Publication:6560202
DOI10.1007/BFB0027116zbMATH Open1543.68432MaRDI QIDQ6560202
Daniel P. Bovet, Andrea Clementi, Riccardo Silvestri, Pilu Crescenzi
Publication date: 21 June 2024
Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10) Approximation algorithms (68W25) Randomized algorithms (68W20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel computation and conflicts in memory access
- Optimization, approximation, and complexity classes
- Approximation algorithms for combinatorial problems
- On a set of almost deterministic k-independent random variables
- On the structure of linear graphs
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- A fast parallel algorithm for the maximal independent set problem
- Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems
- Approximation algorithms for NP-complete problems on planar graphs
- A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers
- A parallel approximation algorithm for positive linear programming
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)
