Deterministic Approximation Algorithm for Graph Burning

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F25%3A10512220" target="_blank" >RIV/00216208:11320/25:10512220 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.4230/LIPIcs.ESA.2025.108" target="_blank" >https://doi.org/10.4230/LIPIcs.ESA.2025.108</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.4230/LIPIcs.ESA.2025.108" target="_blank" >10.4230/LIPIcs.ESA.2025.108</a>

Result language

angličtina

Original language name

Deterministic Approximation Algorithm for Graph Burning

Original language description

Graph Burning models a contagion spreading in a network as a process such that in each step one node is infected and also the infection spreads to all neighbors of previously infected nodes. Formally, the burning number b(G) of a given graph G = (V, E), possibly with edge lengths, is the minimum number g such that there exists a sequence of nodes v&lt;inf&gt;1&lt;/inf&gt;, . . ., v&lt;inf&gt;g&lt;/inf&gt; satisfying the property that for each w ELEMENT OF V there exists i ELEMENT OF {1, . . ., g} so that the distance between w and vi is at most g - i. We present an elegant deterministic 2.314-approximation algorithm for the Graph Burning problem on general graphs with arbitrary edge lengths. This algorithm matches the approximation ratio of the previous randomized 2.314-approximation algorithm and improves on the previous deterministic 3-approximation algorithm.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GX19-27871X" target="_blank" >GX19-27871X: Efficient approximation algorithms and circuit complexity</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2025

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

33rd Annual European Symposium on Algorithms (ESA 2025)

ISBN

978-3-95977-395-9

ISSN

1868-8969

e-ISSN

1868-8969

Number of pages

7

Pages from-to

—

Publisher name

Schloss Dagstuhl, Leibniz-Zentrum für Informatik

Place of publication

Wadern

Event location

Warsaw

Event date

Sep 15, 2025

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—