Approximation algorithms and lower bounds for graph burning

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

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Editors:
  • Megow, N.
  • Smith, A.
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:
  • Published: 4 September 2023
  • Published (online): 4 September 2023
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):

Download

Export

Statistics