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

搜索-多样化问题的改进近似算法及下界

Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems

Amir Abboud, Vincent Cohen-Addad, Euiwoong Lee, Pasin Manurangsi

摘要:

我们研究了与多样化搜索结果相关的几个问题。我们在下面的每一个问题中给出了改进的近似算法,以及一些下界。- 我们给出了用于多样化搜索排名问题的多项式时间近似方案(PTAS)[Bansal等人,ICALP 2010],其目标是最小化贴现累积收益。我们的PTAS在时间上运行$n^{2^{O(\log(1/ε)/ε)}} \cdot m^{O(1)}$,其中$n$表示数据库中元素的数量。作为补充,我们证明了没有PTAS可以在假设Gap-ETH的情况下及时运行$f(ε) \cdot (nm)^{2^{o(1/ε)}}$;因此我们的运行时间几乎很紧。我们的两个边界回答了Bansal等人的公开问题。-我们接下来考虑最大和分散问题,其目标是从最大化分散的$n$元素中选择$k$,分散被定义为给定度量下的成对距离之和。我们给出了一个拟多项式时间逼近方案的问题,运行在时间$n^{O_ε(\log n)}$。这改进了先前已知的具有近似比率0.5的多项式时间算法[Hassin等人,Oper保留信函1997; Borodin等人,ACM Trans.Algorithms 2017]。此外,我们观察到,已知的约简排除了假设ETH在$n^{\tilde{o}_ε(\log n)}$时间内运行的近似方案。- 我们考虑一个推广的最大和分散称为最大和多样化。除了成对距离之和之外,目标还包括另一个函数$f$。对于单调次模$f$,我们给出了一个逼近比任意接近于$(1 - 1/e)$的拟多项式时间算法.这改进了Borodin等人的最佳多项式时间算法,该算法具有近似比$0.5$。此外,由于实现优于$(1 - 1/e)$的近似是NP难的,因此$(1 - 1/e)$因子是紧的[Feige,J. ACM 1998]。

英文摘要:

We study several questions related to diversifying search results. We give improved approximation algorithms in each of the following problems, together with some lower bounds. - We give a polynomial-time approximation scheme (PTAS) for a diversified search ranking problem [Bansal et al., ICALP 2010] whose objective is to minimizes the discounted cumulative gain. Our PTAS runs in time $n^{2^{O(\log(1/ε)/ε)}} \cdot m^{O(1)}$ where $n$ denotes the number of elements in the databases. Complementing this, we show that no PTAS can run in time $f(ε) \cdot (nm)^{2^{o(1/ε)}}$ assuming Gap-ETH; therefore our running time is nearly tight. Both of our bounds answer open questions of Bansal et al. - We next consider the Max-Sum Dispersion problem, whose objective is to select $k$ out of $n$ elements that maximizes the dispersion, which is defined as the sum of the pairwise distances under a given metric. We give a quasipolynomial-time approximation scheme for the problem which runs in time $n^{O_ε(\log n)}$. This improves upon previously known polynomial-time algorithms with approximate ratios 0.5 [Hassin et al., Oper. Res. Lett. 1997; Borodin et al., ACM Trans. Algorithms 2017]. Furthermore, we observe that known reductions rule out approximation schemes that run in $n^{\tilde{o}_ε(\log n)}$ time assuming ETH. - We consider a generalization of Max-Sum Dispersion called Max-Sum Diversification. In addition to the sum of pairwise distance, the objective includes another function $f$. For monotone submodular $f$, we give a quasipolynomial-time algorithm with approximation ratio arbitrarily close to $(1 - 1/e)$. This improves upon the best polynomial-time algorithm which has approximation ratio $0.5$ by Borodin et al. Furthermore, the $(1 - 1/e)$ factor is tight as achieving better-than-$(1 - 1/e)$ approximation is NP-hard [Feige, J. ACM 1998].

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

↑