Square and rectangle covering with outliers

Hee Kap Ahn, Sang Won Bae, Sang Sub Kim, Cozzetti Matias Korman, Iris Reinbacher, Wanbin Son

研究成果: Conference contribution

抄録

For a set of n points in the plane, we consider the axis-aligned (p,k)-Box Covering problem: Find p axis-aligned, pairwise disjoint boxes that together contain exactly n-k points. Here, our boxes are either squares or rectangles, and we want to minimize the area of the largest box. For squares, we present algorithms that find the solution in O(n+klogk) time for p=1, and in O(nlogn+k p log p k) time for p=2,3. For rectangles we have running times of O(n+k 3) for p=1 and O(nlogn+k 2+p log p-1 k) time for p=2,3. In all cases, our algorithms use O(n) space.

本文言語English
ホスト出版物のタイトルFrontiers in Algorithmics - Third International Workshop, FAW 2009, Proceedings
ページ132-140
ページ数9
DOI
出版ステータスPublished - 2009 11 16
イベント3rd International Frontiers of Algorithmics Workshop, FAW 2009 - Hefei, China
継続期間: 2009 6 202009 6 23

出版物シリーズ

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

Other

Other3rd International Frontiers of Algorithmics Workshop, FAW 2009
CountryChina
CityHefei
Period09/6/2009/6/23

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Square and rectangle covering with outliers」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル