Improved and generalized algorithms for burning a planar point set

DOI10.1007/978-3-031-27051-2_9arXiv2209.13024MaRDI QIDQ6091150

J. Mark Keil, Prashant Gokhale, Debajyoti Mondal

Publication date: 24 November 2023

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.13024

zbMATH Keywords

approximation algorithmNP-hardcomputational geometryburning number

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Improved results on geometric hitting set problems
• Selecting and covering colored points
• Approximation algorithms for graph burning
• Burning a graph is hard
• Burning a Graph as a Model of Social Contagion
• Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier
• A survey of graph burning
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• APX-hardness and approximation for the \(k\)-burning number problem

This page was built for publication: Improved and generalized algorithms for burning a planar point set