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

彩色k-中心的常数逼近

A Constant Approximation for Colorful k-Center

Sayan Bandyapadhyay, Tanmay Inamdar, Shreyas Pai, Kasturi Varadarajan

摘要:

在本文中,我们考虑彩色$k$ -中心问题,这是一个推广的著名的$k$ -中心问题。在这里,我们给出了度量空间中的红色和蓝色点,以及每种颜色的覆盖要求。目标是找到最小半径$ρ$,使得利用半径为$ρ$的$k$球,可以覆盖每种颜色的期望数量的点。我们得到一个常数近似这个问题在欧几里德平面。我们通过结合适用于任何度量空间的“伪近似”算法和适用于平面中特殊类别实例的近似算法来获得此结果。后一种算法使用一种新的连接到图中的某个匹配问题。

英文摘要:

In this paper, we consider the colorful $k$-center problem, which is a generalization of the well-known $k$-center problem. Here, we are given red and blue points in a metric space, and a coverage requirement for each color. The goal is to find the smallest radius $ρ$, such that with $k$ balls of radius $ρ$, the desired number of points of each color can be covered. We obtain a constant approximation for this problem in the Euclidean plane. We obtain this result by combining a "pseudo-approximation" algorithm that works in any metric space, and an approximation algorithm that works for a special class of instances in the plane. The latter algorithm uses a novel connection to a certain matching problem in graphs.

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

↑