An approximation algorithm for maximum weight budgeted connected set cover.

Yingli Ran Zhao Zhang Ker-I Ko Jun Liang

Published in: J. Comb. Optim. (2016)

Keyphrases

set cover
maximum weight
np hard
dynamic programming
objective function
worst case
learning algorithm
cost function
random walk
approximation algorithms
weighted graph
multi objective
linear programming
mathematical model
knapsack problem
graph structure
optimization process
search space