arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1502.04918cs.CG
收藏

加权单位圆盘覆盖问题的一个PTAS

A PTAS for the Weighted Unit Disk Cover Problem

Jian Li, Yifei Jin

摘要:

给出了欧氏平面上的一组加权单位圆和一组点。最小重量单位磁盘覆盖(\UDC)问题要求覆盖所有给定点的最小总重量的磁盘子集。\UDC \是几何集合覆盖问题中的一个,在过去的二十年里(对于许多不同的几何值域空间,如(单位)圆盘,半空间,矩形,三角形)得到了广泛的研究。已知未加权的\UDC \问题是NP-困难的,并且允许一个多项式时间近似方案(PTAS).对于加权的\UDC \问题,已经开发了几个常数近似。然而,这个问题是否承认PTAS一直是一个悬而未决的问题。在本文中,我们肯定地回答这个问题,提出了第一个PTAS的\UDC。我们的结果暗示了单位圆盘图中最小权支配集问题的第一个PTAS。结合已有的思想,我们的结果还可以用于获得单位圆盘图中最大生存覆盖问题的第一个PTAS和连通支配集问题的改进的常数逼近比.

英文摘要:

We are given a set of weighted unit disks and a set of points in Euclidean plane. The minimum weight unit disk cover (\UDC) problem asks for a subset of disks of minimum total weight that covers all given points. \UDC\ is one of the geometric set cover problems, which have been studied extensively for the past two decades (for many different geometric range spaces, such as (unit) disks, halfspaces, rectangles, triangles). It is known that the unweighted \UDC\ problem is NP-hard and admits a polynomial-time approximation scheme (PTAS). For the weighted \UDC\ problem, several constant approximations have been developed. However, whether the problem admits a PTAS has been an open question. In this paper, we answer this question affirmatively by presenting the first PTAS for \UDC. Our result implies the first PTAS for the minimum weight dominating set problem in unit disk graphs. Combining with existing ideas, our result can also be used to obtain the first PTAS for the maxmimum lifetime coverage problem and an improved constant approximation ratio for the connected dominating set problem in unit disk graphs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑