A 4.31-approximation for the geometric unique coverage problem on unit disks

Takehiro Ito, Shin Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

We give an improved approximation algorithm for the unique unit-disk coverage problem: Given a set of points and a set of unit disks, both in the plane, we wish to find a subset of disks that maximizes the number of points contained in exactly one disk in the subset. Erlebach and van Leeuwen (2008) introduced this problem as the geometric version of the unique coverage problem, and gave a polynomial-time 18-approximation algorithm. In this paper, we improve this approximation ratio 18 to 2 + 4/√3 + ε (< 4.3095 + ε) for any fixed constant ε > 0. Our algorithm runs in polynomial time which depends exponentially on 1/ε. The algorithm can be generalized to the budgeted unique unit-disk coverage problem in which each point has a profit, each disk has a cost, and we wish to maximize the total profit of the uniquely covered points under the condition that the total cost is at most a given bound.

本文言語English
ホスト出版物のタイトルAlgorithms and Computation - 23rd International Symposium, ISAAC 2012, Proceedings
出版社Springer Verlag
ページ372-381
ページ数10
ISBN(印刷版)9783642352607
DOI
出版ステータスPublished - 2012
イベント23rd International Symposium on Algorithms and Computation, ISAAC 2012 - Taipei, Taiwan, Province of China
継続期間: 2012 12 192012 12 21

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
7676 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other23rd International Symposium on Algorithms and Computation, ISAAC 2012
国/地域Taiwan, Province of China
CityTaipei
Period12/12/1912/12/21

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「A 4.31-approximation for the geometric unique coverage problem on unit disks」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル