多方式割问题的改进近似算法:通过新旧混合的舍入方案
Improved Approximation Algorithms for Multiway Cut by Large Mixtures of New and Old Rounding Schemes
AI总结:
本文提出了一种改进的多方式割问题近似算法,通过混合新旧舍入方案,将近似比从1.2965降低到1.2787,并在k≥4时取得了25年来最佳结果。
摘要:
多方式割问题的输入是一个加权无向图,具有非负边权和k个指定终端。目标是将图的顶点划分为k个部分,每个部分包含一个终端,使得不同部分间边权和最小。该问题对于k≥3是APX难的。目前最好的近似算法由Sharma和Vondrák [STOC 2014] 提出,近似比为1.2965。本文提出了一种改进的算法,近似比为1.2787。此外,对于小k≥4,我们首次在25年内改进了Karger等人 [STOC 1999] 的最佳近似比。我们的主要技术贡献是关于Călinescu、Karloff和Rabani [STOC 1998] 的LP松弛的舍入新见解,其整数比与多方式割的近似比一致,假设唯一游戏猜想 [Manokaran等人,STOC 2008] 成立。首先,我们引入了一种广义的舍入方案,该方案由Kleinberg和Tardos [FOCS 1999] 提出,并用它替代了Buchbinder等人 [STOC 2013] 和Sharma和Vondrák使用的指数时钟舍入方案。其次,虽然之前的算法使用了两种、三种或四种基本舍入方案的混合,每个来自不同的舍入方案家族,我们的算法使用了数百种基本舍入方案的混合,每个参数化为具有不同概率分布的随机变量,包括许多来自同一家族的不同舍入方案。我们通过分析技术和区间算术的结合,对改进的算法进行了完全严谨的分析。
英文摘要:
The input to the Multiway Cut problem is a weighted undirected graph, with nonnegative edge weights, and $k$ designated terminals. The goal is to partition the vertices of the graph into $k$ parts, each containing exactly one of the terminals, such that the sum of weights of the edges connecting vertices in different parts of the partition is minimized. The problem is APX-hard for $k\ge3$. The currently best known approximation algorithm for the problem for arbitrary $k$, obtained by Sharma and Vondrák [STOC 2014] more than a decade ago, has an approximation ratio of 1.2965. We present an algorithm with an improved approximation ratio of 1.2787. Also, for small values of $k \ge 4$ we obtain the first improvements in 25 years over the currently best approximation ratios obtained by Karger et al. [STOC 1999]. (For $k=3$ an optimal approximation algorithm is known.) Our main technical contributions are new insights on rounding the LP relaxation of Călinescu, Karloff, and Rabani [STOC 1998], whose integrality ratio matches Multiway Cut's approximability ratio, assuming the Unique Games Conjecture [Manokaran et al., STOC 2008]. First, we introduce a generalized form of a rounding scheme suggested by Kleinberg and Tardos [FOCS 1999] and use it to replace the Exponential Clocks rounding scheme used by Buchbinder et al. [STOC 2013] and by Sharma and Vondrák. Second, while previous algorithms use a mixture of two, three, or four basic rounding schemes, each from a different family of rounding schemes, our algorithm uses a computationally-discovered mixture of hundreds of basic rounding schemes, each parametrized by a random variable with a distinct probability distribution, including in particular many different rounding schemes from the same family. We give a completely rigorous analysis of our improved algorithms using a combination of analytical techniques and interval arithmetic.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。