Approximation algorithms and lower bounds for graph burning

DOI10.4230/LIPICS.APPROX/RANDOM.2023.9MaRDI QIDQ6663018zbMATH OpenFDO

Authors Matej Lieskovský, Jiří Sgall, Andreas Emil Feldmann

Publication date 14 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2023.9

zbMATH Keywords

approximation algorithmsgraph algorithmsrandomized algorithms

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cited in

(3)

• Burning path-like and clique-like graphs
• Orientable burning number of graphs
• Deterministic approximation algorithm for graph burning

This page was built for publication: Approximation algorithms and lower bounds for graph burning

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