三色圆盘堆积面积的一个下界
A Lower Bound on the Area of a 3-Coloured Disk Packing
摘要:
给定平面上具有并集面积$A$的单位圆盘集合,通过选择圆盘的成对不相交子集,可以覆盖$A$的哪一部分?Rado测量了1/4,证明了$1/4.41$。出于无线接入点的信道分配问题,其中使用3个信道是一个标准的做法,我们考虑一个变体,其中所选择的子集的磁盘必须是3-colorphine与磁盘相同的颜色成对不相交。对于这个变种的问题,我们推测,它总是可以覆盖至少$1/1.41$的联合区,并证明$1/2.09$。我们还提供了一个$O(n^2)$算法来选择一个子集实现$1/2.77$界。
英文摘要:
Given a set of unit-disks in the plane with union area $A$, what fraction of $A$ can be covered by selecting a pairwise disjoint subset of the disks? Rado conjectured 1/4 and proved $1/4.41$. Motivated by the problem of channel-assignment for wireless access points, in which use of 3 channels is a standard practice, we consider a variant where the selected subset of disks must be 3-colourable with disks of the same colour pairwise-disjoint. For this variant of the problem, we conjecture that it is always possible to cover at least $1/1.41$ of the union area and prove $1/2.09$. We also provide an $O(n^2)$ algorithm to select a subset achieving a $1/2.77$ bound.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。