Ultrafast Randomized Parallel Construction and Approximation Algorithms for Spanning Forests in Dense Graphs.
Anders DessmarkCarsten DorgerlohAndrzej LingasJuergen WirtgenPublished in: IPPS/SPDP Workshops (1998)
Keyphrases
- approximation algorithms
- randomized algorithms
- undirected graph
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- network design problem
- approximation guarantees
- set cover
- facility location problem
- constant factor
- approximation ratio
- open shop
- spanning tree
- combinatorial auctions
- primal dual
- np hardness
- approximation schemes
- parallel computing
- shared memory
- graph matching
- optimal solution
- precedence constraints
- strongly np hard