Approximation Algorithms for Massive High-Rate Data Streams.
Alfredo CuzzocreaPublished in: ADBIS Workshops (2012)
Keyphrases
- approximation algorithms
- high rate
- data streams
- low rate
- sliding window
- special case
- np hard
- false alarms
- worst case
- minimum cost
- vertex cover
- set cover
- facility location problem
- sensor networks
- data sets
- open shop
- precedence constraints
- false negative
- randomized algorithms
- approximation schemes
- combinatorial auctions
- network design problem
- constant factor
- polynomial time approximation
- undirected graph
- np hardness
- primal dual