A Massively Parallel Algorithm for Minimum Weight Vertex Cover.
Mohsen GhaffariCe JinDaan NilisPublished in: CoRR (2020)
Keyphrases
- parallel algorithm
- vertex cover
- minimum weight
- planar graphs
- spanning tree
- approximation algorithms
- bipartite graph
- greedy heuristic
- weighted graph
- parallel computing
- shared memory
- minimum spanning tree
- partial order
- minimum cost
- precedence constraints
- randomized algorithm
- traveling salesman problem
- tree patterns
- objective function