A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares

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

研究成果: Conference contribution

8 被引用数 (Scopus)

抄録

We give a polynomial-time approximation scheme for the unique unit-square coverage problem: given a set of points and a set of axis-parallel unit squares, both in the plane, we wish to find a subset of squares that maximizes the number of points contained in exactly one square in the subset. Erlebach and van Leeuwen (2008) introduced this problem as the geometric version of the unique coverage problem, and the best approximation ratio by van Leeuwen (2009) before our work was 2. Our scheme can be generalized to the budgeted unique unit-square coverage problem, in which each point has a profit, each square 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
ホスト出版物のタイトルAlgorithm Theory, SWAT 2012 - 13th Scandinavian Symposium and Workshops, Proceedings
ページ24-35
ページ数12
DOI
出版ステータスPublished - 2012
イベント13th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2012 - Helsinki, Finland
継続期間: 2012 7 42012 7 6

出版物シリーズ

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

Other

Other13th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2012
国/地域Finland
CityHelsinki
Period12/7/412/7/6

ASJC Scopus subject areas

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

フィンガープリント

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

引用スタイル