几何最大覆盖问题的线性时间逼近格式
Linear Time Approximation Schemes for Geometric Maximum Coverage
摘要:
我们研究以下几何版本的最大覆盖问题的近似算法:设P是一组n个加权点在平面上。我们希望放置m个a * b矩形,使得这些矩形覆盖的点的权重之和最大化.对于任何固定的> 0,我们提出了有效的近似方案,可以找到最优解的(1-ε)-近似.特别地,当m = 1时,我们的算法在线性时间O(nlog(1/ε))内运行,比以前的结果有所改进.当m > 1时,我们给出了一个时间复杂度为O(n/εlog(1/ε)+m(1/ε)^(O(min(sqrt(m),1/ε)的算法.
英文摘要:
We study approximation algorithms for the following geometric version of the maximum coverage problem: Let P be a set of n weighted points in the plane. We want to place m a * b rectangles such that the sum of the weights of the points in P covered by these rectangles is maximized.For any fixed > 0, we present efficient approximation schemes that can find (1-ε)-approximation to the optimal solution.In particular, for m = 1, our algorithm runs in linear time O(n log( 1/ε)), improving over the previous result. For m > 1, we present an algorithm that runs in O(n/εlog(1/ε)+m(1/ε)^(O(min(sqrt(m),1/ε))) time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。