Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

# Improved and Generalized Algorithms for Burning a Planar Point Set

Gokhale, P and Keil, JM and Mondal, D (2023) Improved and Generalized Algorithms for Burning a Planar Point Set. In: 17th International Conference and Workshops on Algorithms and Computation, WALCOM 2023, 22-24 March 2023, Hsinchu, pp. 90-101.

 Preview
PDF
walcom_2023.pdf - Published Version

Download (632kB) | Preview
Official URL: https://doi.org/10.1007/978-3-031-27051-2_9

## Abstract

Given a set P of points in, a point burning process is a discrete time process to burn all the points of P where fires must be initiated at the points of P. Specifically, the point burning process starts with a single burnt point from P, and at each subsequent step, burns all the points in that are within one unit distance from the currently burnt points, as well as one other unburnt point of P (if exists). The point burning number of P is the smallest number of steps required to burn all the points of P. If we allow the fire to be initiated anywhere in, then the burning process is called an anywhere burning process. One can think of the anywhere burning problem as finding the minimum integer r such that P can be covered with disks of radii. A burning process provides a simple model for distributing commodities to the locations in P by sending a daily bulk shipment to a distribution center, i.e., the place where we initiate a fire. The burning number corresponds to the minimum number of days to reach all locations. In this paper we show that both point and anywhere burning problems admit PTAS in one dimension. We then show that in two dimensions, point burning and anywhere burning are and approximable, respectively, for every, which improves the previously known approximation for these problems. We then generalize the results by allowing the points to have different fire spreading rates, and prove that even if the burning sources are given as input, finding a point burning sequence itself is NP-hard. Finally, we obtain a 2-approximation for burning the maximum number of points in a given number of steps. Â© 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

Item Type: Conference Paper Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Springer Science and Business Media Deutschland GmbH The copyright for this article belongs to the Authors. Computational geometry; Fires, Burning number; Burning problems; Burning process; Discrete time; Distribution centres; Generalized algorithms; Improved * algorithm; NP-hard; Planar point sets; Simple modeling, Approximation algorithms Division of Electrical Sciences > Electrical Engineering 13 Apr 2023 10:33 13 Apr 2023 10:33 https://eprints.iisc.ac.in/id/eprint/81329

### Actions (login required)

 View Item