Login / Signup
Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs.
Ioannis Caragiannis
Aleksei V. Fishkin
Christos Kaklamanis
Evi Papaioannou
Published in:
Discret. Appl. Math. (2007)
Keyphrases
</>
lower bound
upper bound
worst case
graph theory
randomized algorithms
learning algorithm
computational complexity
optimization problems
theoretical analysis
lower and upper bounds
upper and lower bounds
online algorithms
data structure
randomized algorithm
combinatorial optimization
learning theory