Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover.

Amit Chakrabarti Anthony Wirth

Published in: CoRR (2015)

Keyphrases

set cover
approximation algorithms
greedy algorithm
greedy heuristics
network flow
np hard
worst case
knowledge discovery
data streams
high dimensional
minimum cost
greedy heuristic
machine learning
dynamic programming
convex hull
solution space