Login / Signup
Complexity and approximation of the connected set-cover problem.
Wei Zhang
Weili Wu
Wonjun Lee
Ding-Zhu Du
Published in:
J. Glob. Optim. (2012)
Keyphrases
</>
set cover
approximation algorithms
worst case
greedy heuristics
np hard
greedy algorithm
approximation error
network flow
computational complexity
special case
solution space
social networks
greedy heuristic
dynamic programming
multi dimensional
search algorithm
data structure
neural network