Akademska digitalna zbirka SLovenije - logo
ALL libraries (COBIB.SI union bibliographic/catalogue database)
  • Covering many or few points with unit disks [Elektronski vir]
    Berg, Mark de ; Cabello, Sergio ; Har-Peled, Sariel
    Let ▫$P$▫ be a set of ▫$n$▫ weighted points. We study approximation algorithms for the following two continuous facility-location problems. In the first problem we want to place ▫$m$▫ unit disks, for ... a given constant ▫$m \ge 1$▫, such that the total weight of the points from ▫$P$▫ inside the union of the disks is maximized. We present a deterministic algorithm that can compute, for any ▫$\varepsilon > 0$▫ a ▫$(1-\varepsilon)$▫-approximation to the optimal solution in ▫$O(n\log n + \varepsilon^{-4m}\log^{2m}(1/\varepsilon))$▫ time. In the second problem we want to place a single disk with center in a given constant-complexity region ▫$X$▫ such that the total weight of the points from ▫$P$▫ inside the disk is minimized. Here we present an algorithm that can compute, for any ▫$\varepsilon > 0$▫, with high probability a ▫$(1+\varepsilon)$▫-approximation to the optimal solution in ▫$O(n (\log^3 n + \varepsilon^{-4} \log^2 n))$▫ expected time.
    Source: Preprint series. - ISSN 1318-4865 (Vol. 44, št. 1026, 2006, str. 1-24)
    Type of material - e-article
    Publish date - 2006
    Language - english
    COBISS.SI-ID - 14788185