English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

In this article, we consider the problem of computing minimum dominating setfor a given set $S$ of $n$ points in $\IR^2$. Here the objective is to find aminimum cardinality subset $S'$ of $S$ such that the union of the unit radiusdisks centered at the points in $S'$ covers all the points in $S$. We firstpropose a simple 4-factor and 3-factor approximation algorithms in $O(n^6 \logn)$ and $O(n^{11} \log n)$ time respectively improving time complexities by afactor of $O(n^2)$ and $O(n^4)$ respectively over the best known resultavailable in the literature [M. De, G.K. Das, P. Carmi and S.C. Nandy, {\itApproximation algorithms for a variant of discrete piercing set problem forunit disk}, Int. J. of Comp. Geom. and Appl., to appear]. Finally, we propose avery important shifting lemma, which is of independent interest and using thislemma we propose a $\frac{5}{2}$-factor approximation algorithm and a PTAS forthe minimum dominating set problem.

Minimum Dominating Set for a Point Set in $\IR^2$