The input to the distant representatives problem is a set of $n$ objects in the plane and the goal is to find a representative point from each object while maximizing the distance between the closest pair of points. When the objects are axis-aligned rectangles, we give polynomial time constant-factor approximation algorithms for the $L_1$, $L_2$, and $L_\infty$ distance measures. We also prove lower bounds on the approximation factors that can be achieved in polynomial time (unless P = NP).
翻译：对远方代表问题的投入是在平面上一组美元对象,目标是从每个对象中找到一个代表点,同时尽量扩大最接近的两点之间的距离。当对象为轴对齐矩形时,我们给出了1美元、2美元和距离尺度$L++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
相关内容
微信扫码咨询专知VIP会员