度量违反距离:重新审视和扩展
Metric Violation Distance: Revisited and Extended
摘要:
度量数据在各种设置中起着重要的作用,例如基于度量的索引、聚类、分类和一般的近似算法。由于测量误差、噪声或无法完全收集所有数据,距离集合可能不满足基本度量要求,最明显的是三角不等式。因此,去年作者介绍了度量违反距离(MVD)问题,其中输入是一个无向和正加权的完全图,目标是确定一个最小的边基数子集,其权重可以修改,从而得到的图是它自己的度量完成。这个问题被证明是APX困难的,此外,一个$O(OPT^{1/3})$ -近似显示,其中$OPT$是最优解的大小。在本文中,我们介绍了广义度量违反距离(GMVD)的问题,其中的目标是相同的,但输入图不再需要是完整的。对于GMVD,我们证明了更强的硬度结果,并提供了一个显着更快的近似算法与改进的近似保证。特别是,我们给出了一个近似保持减少从研究多切割问题,这是很难近似在任何恒定的因素,假设唯一的游戏猜想。我们的近似因子取决于赤字值,对于给定的循环,赤字值是最大的单边权重减去所有其他边的权重之和。请注意,在度量完全图中,没有圈具有正亏。我们给出了\gmvd的一个$O(c \log n)$ -近似算法,其中$c$是输入图中不同的正循环亏损值的个数.
英文摘要:
Metric data plays an important role in various settings such as metric-based indexing, clustering, classification, and approximation algorithms in general. Due to measurement error, noise, or an inability to completely gather all the data, a collection of distances may not satisfy the basic metric requirements, most notably the triangle inequality. Thus last year the authors introduced the Metric Violation Distance (MVD) problem, where the input is an undirected and positively-weighted complete graph, and the goal is to identify a minimum cardinality subset of edges whose weights can be modified such that the resulting graph is its own metric completion. This problem was shown to be APX-hard, and moreover an $O(OPT^{1/3})$-approximation was shown, where $OPT$ is the size of the optimal solution. In this paper we introduce the Generalized Metric Violation Distance (GMVD) problem, where the goal is the same, but the input graph is no longer required to be complete. For GMVD we prove stronger hardness results, and provide a significantly faster approximation algorithm with an improved approximation guarantee. In particular, we give an approximation-preserving reduction from the well studied MultiCut problem, which is hard to approximate within any constant factor assuming the Unique Games Conjecture. Our approximation factor depends on deficit values, which for a given cycle is the largest single edge weight minus the sum of the weights of all its other edges. Note that no cycle has positive deficit in a metric complete graph. We give an $O(c \log n)$-approximation algorithm for \gmvd, where $c$ is the number of distinct positive cycle deficit values in the input graph.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。