Approximation algorithm for the minimum weight connected k-subgraph cover problem.

Yaping Zhang Yishuo Shi Zhao Zhang

Published in: Theor. Comput. Sci. (2014)

Keyphrases

minimum weight
np hard
dynamic programming
learning algorithm
greedy heuristic
cost function
probabilistic model
particle swarm optimization
knapsack problem
maximum weight
randomized algorithm
spanning tree
weighted graph
segmentation algorithm
scheduling problem
special case
objective function