Approximation algorithms for graph burning

DOI10.1007/978-3-030-14812-6_6OpenAlexW2900279274MaRDI QIDQ2327458

Shahin Kamali, Anthony Bonato

Publication date: 15 October 2019

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

zbMATH Keywords

graph algorithmsapproximation algorithmsinformation disseminationsocial contagiongraph burning problem

Mathematics Subject Classification ID

Related Items (15)

Burning grids and intervals ⋮ A survey of graph burning ⋮ Burning graph classes ⋮ Parameterized complexity of graph burning ⋮ Graph burning: tight bounds on the burning numbers of path forests and spiders ⋮ Improved and generalized algorithms for burning a planar point set ⋮ Groups burning: analyzing spreading processes in community-based networks ⋮ Burning and \(w\)-burning of geometric graphs ⋮ Graph burning and non-uniform \(k\)-centers for small treewidth ⋮ Burning the plane. Densities of the infinite Cartesian grid ⋮ Burning Two Worlds ⋮ Parameterized Complexity of Graph Burning ⋮ APX-hardness and approximation for the \(k\)-burning number problem ⋮ APX-hardness and approximation for the \(k\)-burning number problem ⋮ Improved bounds for burning fence graphs

This page was built for publication: Approximation algorithms for graph burning