{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/a-3-2-b-g-approximation-algorithm-for-the","title":"Burning graphs through farthest-first traversal","arxiv_id":"2011.15019","date":"2020-11-30","proceeding":null,"authors":["Jesús García Díaz","Julio César Pérez Sansalvador","Lil María Xibai Rodríguez Henríquez","José Alejandro Cornejo Acosta"],"abstract":"The graph burning problem is an NP-hard combinatorial optimization problem that helps quantify the vulnerability of a graph to contagion. This paper introduces a simple farthest-first traversal-based approximation algorithm for this problem over general graphs. We refer to this proposal as the Burning Farthest-First (BFF) algorithm. BFF runs in $O(n^3)$ steps and has an approximation factor of $3-2/b(G)$, where $b(G)$ is the size of an optimal solution. Despite its simplicity, BFF tends to generate near-optimal solutions when tested over some benchmark datasets; in fact, it returns similar solutions to those returned by much more elaborated heuristics from the literature.","url_abs":"https://arxiv.org/abs/2011.15019v4","url_pdf":"https://arxiv.org/pdf/2011.15019v4.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"a-3-2-b-g-approximation-algorithm-for-the","repo_url":"https://github.com/jesgadiaz/BFF","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"a-3-2-b-g-approximation-algorithm-for-the","repo_url":"https://github.com/jesgadiaz/bgp","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"a-3-2-b-g-approximation-algorithm-for-the","repo_url":"https://github.com/alex-cornejo/bff_alg","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}