Login / Signup
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs.
Mark de Berg
Hans L. Bodlaender
Sándor Kisfaludi-Bak
Dániel Marx
Tom C. van der Zanden
Published in:
STOC (2018)
Keyphrases
</>
lower bound
worst case
upper bound
graph theory
online algorithms
learning algorithm
running times
probabilistic model
theoretical analysis
branch and bound
upper and lower bounds
computational complexity
optimization problems
vc dimension
lower and upper bounds