• DOI:10.1145/3188745.3188854
Corpus ID: 4781280

A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs

@article{Berg2018AFF,
  title={A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs},
  author={M. Berg and H. Bodlaender and S{\'a}ndor Kisfaludi-Bak and D. Marx and T. V. D. Zanden},
  journal={Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing},
  year={2018}
}

M. Berg, H. Bodlaender, +2 authors T. V. D. Zanden

Published 2018

Computer Science, Mathematics

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing

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 a wide range of geometric intersection graphs (intersections of similarly sized fat objects), yielding algorithms with running time 2O(n1−1/d) for any fixed dimension d≥ 2 for many well known graph problems, including Independent Set, r-Dominating Set for constant r, and Steiner Tree. For most problems, we get improved… CONTINUE READING

View on ACM

arxiv.org

Save to Library

Create Alert

Cite

Launch Research Feed