通过色散获得近似最优和多样解
Obtaining Approximately Optimal and Diverse Solutions via Dispersion
摘要:
长期以来,人们一直对计算优化问题的各种解决方案感兴趣。1995年,受瑞典政府机构重新分配的启发,J.Krarup提出了寻找具有最小总重量的$k$边不相交Hamilton回路的问题,称为巡游推销员问题(PSP)。从那时起,研究人员研究了寻找生成树,路径,顶点覆盖,匹配等多种解决方案的复杂性。与PSP对解决方案的总权重有约束不同,最近的工作涉及寻找所有最优的各种解决方案。然而,有时精确解的空间可能太小而无法实现足够的多样性。受此启发,我们开始研究获得不同的,但近似最优的解决方案的优化问题。形式上,给定一个整数$k$,一个近似因子$c$,和一个优化问题的实例$I$,我们的目标是获得一组$I$的$k$解,a)对于$I$都是$c$近似最优的,b)最大化$k$解的多样性。因此,找到这样的解决方案需要更好地理解优化函数的全局景观。我们表明,给定任何度量的解决方案的空间,和多样性措施的解决方案之间的成对距离的总和,这个问题可以解决分散和多目标优化相结合的想法。首先,我们提供了一个一般的减少相关的约束优化(BCO)问题,其中一个目标函数是最大化(最小化)的第二个目标函数的约束。然后,我们证明了双近似的BCO可以用来给双近似的不同的近似最优解的问题,一点开销。
英文摘要:
There has been a long-standing interest in computing diverse solutions to optimization problems. Motivated by reallocation of governmental institutions in Sweden, in 1995 J. Krarup posed the problem of finding $k$ edge-disjoint Hamiltonian Circuits of minimum total weight, called the peripatetic salesman problem (PSP). Since then researchers have investigated the complexity of finding diverse solutions to spanning trees, paths, vertex covers, matchings, and more. Unlike the PSP that has a constraint on the total weight of the solutions, recent work has involved finding diverse solutions that are all optimal. However, sometimes the space of exact solutions may be too small to achieve sufficient diversity. Motivated by this, we initiate the study of obtaining sufficiently-diverse, yet approximately-optimal solutions to optimization problems. Formally, given an integer $k$, an approximation factor $c$, and an instance $I$ of an optimization problem, we aim to obtain a set of $k$ solutions to $I$ that a) are all $c$ approximately-optimal for $I$ and b) maximize the diversity of the $k$ solutions. Finding such solutions, therefore, requires a better understanding of the global landscape of the optimization function. We show that, given any metric on the space of solutions, and the diversity measure as the sum of pairwise distances between solutions, this problem can be solved by combining ideas from dispersion and multicriteria optimization. We first provide a general reduction to an associated budget-constrained optimization (BCO) problem, where one objective function is to be maximized (minimized) subject to a bound on the second objective function. We then prove that bi-approximations to the BCO can be used to give bi-approximations to the diverse approximately optimal solutions problem with a little overhead.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。