Number of the records: 1
Range assignment of base-stations maximizing coverage area without interference
- 1.
SYSNO ASEP 0534821 Document Type J - Journal Article R&D Document Type The record was not marked in the RIV Subsidiary J Článek ve WOS Title Range assignment of base-stations maximizing coverage area without interference Author(s) Acharyya, Ankush (UIVT-O) RID, SAI, ORCID
De, M. (IN)
Nandy, S. C. (IN)
Roy, B. (IN)Number of authors 4 Source Title Theoretical Computer Science. - : Elsevier - ISSN 0304-3975
Roč. 804 (2020), s. 81-97Language eng - English Country NL - Netherlands Keywords time approximation schemes ; packing ; Quadratic programming ; Discrete packing ; Range assignment in wireless communication ; NP-hardness ; Approximation algorithm ; ptas UT WOS 000510312500006 EID SCOPUS 85075382130 DOI 10.1016/j.tcs.2019.10.044 Annotation We study the problem of assigning non-overlapping geometric objects centered at a given set of points such that the sum of area covered by them is maximized. The problem remains open since 2002, as mentioned in a lecture slide of David Eppstein. In this paper, we have performed an exhaustive study on the problem. We show that, if the points are placed in R-2 then the problem is NP-hard even for simplest type of covering objects like disks or squares. In contrast, Eppstein (2017) [10] proposed a polynomial time algorithm for maximizing the sum of radii (or perimeter) of non-overlapping disks when the points are arbitrarily placed in R-2. We show that Eppstein's algorithm for maximizing sum of perimeter of the disks in R-2 gives a 2-approximation solution for the sum of area maximization problem. We also propose a PTAS for the same problem. Our results can be extended in higher dimensions as well as for a class of centrally symmetric convex objects. Workplace Institute of Computer Science Contact Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800 Year of Publishing 2021
Number of the records: 1