A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs
2020
We give an algorithmic and lower bound framework that facilitates the construction of subexponential algorithms and matching conditional complexity bounds. It can be applied to intersection graphs ...
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
26
References
4
Citations
NaN
KQI