Lieskovský, M., Sgall, J. and Feldmann, A.E. orcid.org/0000-0001-6229-5332 (2023) Approximation algorithms and lower bounds for graph burning. In: Megow, N. and Smith, A., (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023), 11-13 Sep 2023, Georgia, USA. Leibniz International Proceedings in Informatics, LIPIcs, 275 . , 9:1-9:17. ISBN 978-3-95977-296-9
Abstract
Graph Burning models information spreading in a given graph as a process such that in each step one node is infected (informed) and also the infection spreads to all neighbors of previously infected nodes. Formally, given a graph G = (V, E), possibly with edge lengths, the burning number b(G) is the minimum number g such that there exist nodes v0, . . ., vg−1 ∈ V satisfying the property that for each u ∈ V there exists i ∈ {0, . . ., g − 1} so that the distance between u and vi is at most i. We present a randomized 2.314-approximation algorithm for computing the burning number of a general graph, even with arbitrary edge lengths. We complement this by an approximation lower bound of 2 for the case of equal length edges, and a lower bound of 4/3 for the case when edges are restricted to have length 1. This improves on the previous 3-approximation algorithm and an APX-hardness result.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Editors: |
|
Copyright, Publisher and Additional Information: | © MatejLieskovský, Jiří Sgall, and Andreas Emil Feldmann; licensed under Creative Commons License CC-BY 4.0 https://creativecommons.org/licenses/by/4.0/ |
Keywords: | Graph Algorithms; approximation Algorithms; randomized Algorithms |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 21 Nov 2024 15:11 |
Last Modified: | 21 Nov 2024 15:11 |
Status: | Published |
Series Name: | Leibniz International Proceedings in Informatics, LIPIcs |
Refereed: | Yes |
Identification Number: | 10.4230/LIPIcs.APPROX/RANDOM.2023.9 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:219940 |