盒的(同时)类覆盖的逼近性
Approximability of (Simultaneous) Class Cover for Boxes
摘要:
Bereg et al.(2012)介绍了Boxes Class Cover问题,它起源于分类和聚类应用:给定平面上的一组n个点,每个点都是红色或蓝色,找到轴对齐的盒子的最小基数集,其并集覆盖红色点而不覆盖任何蓝色点。在本文中,我们给这个问题的APX-硬度的另一种证明,这也产生了一个明确的下界,其逼近。我们的证明也直接适用于限制在一般位置的点集和所谓的半条被认为是代替盒的情况下,这是一个新的结果。我们还介绍了这个问题的一个对称变体,我们称之为同时盒类覆盖,可以表述如下:给定一个平面上的n个点的集合S,每个点都是红色或蓝色的,找到轴对齐的盒的最小基数集合,这些盒一起覆盖S,使得所有盒只覆盖相同颜色的点,并且没有覆盖红色点的盒与覆盖蓝色点的盒相交。我们证明了该问题也是APX困难的,并给出了一个多项式时间常数因子的近似算法。
英文摘要:
Bereg et al. (2012) introduced the Boxes Class Cover problem, which has its roots in classification and clustering applications: Given a set of n points in the plane, each colored red or blue, find the smallest cardinality set of axis-aligned boxes whose union covers the red points without covering any blue point. In this paper we give an alternative proof of APX-hardness for this problem, which also yields an explicit lower bound on its approximability. Our proof also directly applies when restricted to sets of points in general position and to the case where so-called half-strips are considered instead of boxes, which is a new result. We also introduce a symmetric variant of this problem, which we call Simultaneous Boxes Class Cover and can be stated as follows: Given a set S of n points in the plane, each colored red or blue, find the smallest cardinality set of axis-aligned boxes which together cover S such that all boxes cover only points of the same color and no box covering a red point intersects a box covering a blue point. We show that this problem is also APX-hard and give a polynomial-time constant-factor approximation algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。