Towards faster local search for minimum weight vertex cover on massive graphs.

Shaowei Cai Yuanjie Li Wenying Hou Haoran Wang

Published in: Inf. Sci. (2019)

Keyphrases

vertex cover
minimum weight
planar graphs
bipartite graph
approximation algorithms
spanning tree
weighted graph
minimum spanning tree
greedy heuristic
search space
partial order
precedence constraints
optimal solution
information extraction
simulated annealing
combinatorial optimization
social networks
data points