Deterministic approximation algorithm for graph burning

DOI10.4230/LIPICS.ESA.2025.108MaRDI QIDQ7322524zbMATH OpenFDO

Authors Matej Lieskovský

Publication date 31 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2025.108

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A 10/7-approximation for discrete bamboo garden trimming and continuous trimming on star graphs
• Approximation algorithms and lower bounds for graph burning
• Approximation algorithms for graph burning
• Bounds on the burning numbers of spiders and path-forests
• Burning a graph as a model of social contagion
• Graph burning and non-uniform \(k\)-centers for small treewidth
• How to Burn a Graph
• Towards the 5/6-density conjecture of pinwheel scheduling

Cited in

(1)

• Graph decompositions and length-constrained expanders (invited talk)

This page was built for publication: Deterministic approximation algorithm for graph burning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322524)