On the Advice Complexity of the Set Cover Problem.

Dennis Komm Richard Královic Tobias Mömke

Published in: CSR (2012)

Keyphrases

set cover
greedy algorithm
np hard
greedy heuristics
approximation algorithms
network flow
computational complexity
worst case
convex hull
greedy heuristic
neural network
search algorithm
special case
multi objective