Tight lower bounds for selection in randomly ordered streams.
Amit ChakrabartiT. S. JayramMihai PatrascuPublished in: SODA (2008)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- upper and lower bounds
- worst case
- np hard
- lower and upper bounds
- objective function
- optimal solution
- real time
- data streams
- lower bounding
- optimal cost
- selection algorithm
- genetic algorithm
- linear programming relaxation
- active learning
- e learning
- vc dimension
- database
- quadratic assignment problem