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
    15 Citations
    Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs
    • PDF
    Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
    An ETH-Tight Exact Algorithm for Euclidean TSP
    • 10
    • PDF
    Hyperbolic intersection graphs and (quasi)-polynomial time
    • 2
    • PDF
    ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs
    • PDF
    Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs
    • PDF
    The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms
    • 2
    • PDF
    The Homogeneous Broadcast Problem in Narrow and Wide Strips II: Lower Bounds
    • 3
    • PDF

    References

    SHOWING 1-5 OF 5 REFERENCES
    Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
    • 79
    • Highly Influential
    • PDF
    Parameterized Algorithms
    • 924
    • Highly Influential
    • PDF
    The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two
    • J. Plesník
    • Mathematics, Computer Science
    • Inf. Process. Lett.
    • 1979
    • 98
    • Highly Influential
    Hamilton Paths in Grid Graphs
    • 422
    • Highly Influential
    • PDF
    Complexity of k-SAT
    • R. Impagliazzo, R. Paturi
    • Mathematics, Computer Science
    • Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317)
    • 1999
    • 522
    • Highly Influential
    • PDF