A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs.
Limin WangXiaoyan ZhangZhao ZhangHajo BroersmaPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- vertex cover
- minimum weight
- planar graphs
- approximation algorithms
- spanning tree
- bipartite graph
- weighted graph
- maximum cardinality
- minimum cost
- minimum spanning tree
- polynomial time approximation
- greedy heuristic
- undirected graph
- randomized algorithm
- np hard
- edge weights
- objective function
- special case
- tree patterns
- bin packing
- partial order
- greedy algorithm
- data objects
- connected components