How to match in parallel: approximation algorithms and multicore machines.
Alex PothenPublished in: IA3@SC (2015)
Keyphrases
- approximation algorithms
- identical machines
- shared memory
- special case
- np hard
- worst case
- polynomial time approximation
- precedence constraints
- minimum cost
- parallel programming
- vertex cover
- approximation ratio
- cell processor
- parallel machines
- primal dual
- facility location problem
- constant factor
- level parallelism
- open shop
- approximation schemes
- undirected graph
- network design problem
- parallel processing
- constant factor approximation
- parallel processors
- randomized algorithms
- approximation guarantees
- multicore processors
- computational complexity
- set cover
- combinatorial auctions
- flowshop