Computing-Based Performance Analysis of Approximation Algorithms for the Minimum Weight Vertex Cover Problem of Graphs.
Satoshi TaokaDaisuke TakafujiToshimasa WatanabePublished in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2013)
Keyphrases
- vertex cover
- planar graphs
- minimum weight
- approximation algorithms
- spanning tree
- bipartite graph
- weighted graph
- minimum cost
- greedy heuristic
- minimum spanning tree
- np hard
- undirected graph
- worst case
- special case
- tree patterns
- edge weights
- precedence constraints
- greedy algorithm
- randomized algorithm
- approximation guarantees
- evolutionary algorithm
- branch and bound algorithm
- approximation ratio
- data objects
- polynomial time approximation