Login / Signup
A Framework for Exponential-Time-Hypothesis-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:
SIAM J. Comput. (2020)
Keyphrases
</>
lower bound
worst case
upper bound
learning algorithm
np hard
graph theory
data structure
branch and bound
upper and lower bounds
running times
theoretical analysis
constraint satisfaction problems
branch and bound algorithm
average case
graph structures
average case complexity