arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.00810cs.DScs.DMcs.ITmath.IT
收藏

贪婪MAXCUT算法及其信息量

Greedy MAXCUT Algorithms and their Information Content

Yatao Bian, Alexey Gronskiy, Joachim M. Buhmann

摘要:

MAXCUT定义了一个经典的NP-困难的图划分问题,它是对称非单调无约束次模极大化(USM)问题的一个典型例子。MAXCUT在机器学习、计算机视觉和统计物理学中有着广泛的应用。近似求解MAXCUT的贪心算法依赖于贪婪顶点标记或边收缩策略。这些算法已被研究,通过测量它们的近似比在最坏的情况下设置,但很少有人知道他们的鲁棒性的平均情况下的输入数据的噪声污染的特征。采用近似集编码的框架,提出了一种精确度量五种贪婪MAXCUT算法近似集基数的方法。它们的信息内容探索两种不同的噪声模型产生的图形实例:边缘反转模型和高斯边缘权重模型。研究结果为MAXCUT算法中不同贪婪算法和技术的鲁棒性提供了参考,可用于一般USM问题的算法设计。

英文摘要:

MAXCUT defines a classical NP-hard problem for graph partitioning and it serves as a typical case of the symmetric non-monotone Unconstrained Submodular Maximization (USM) problem. Applications of MAXCUT are abundant in machine learning, computer vision and statistical physics. Greedy algorithms to approximately solve MAXCUT rely on greedy vertex labelling or on an edge contraction strategy. These algorithms have been studied by measuring their approximation ratios in the worst case setting but very little is known to characterize their robustness to noise contaminations of the input data in the average case. Adapting the framework of Approximation Set Coding, we present a method to exactly measure the cardinality of the algorithmic approximation sets of five greedy MAXCUT algorithms. Their information contents are explored for graph instances generated by two different noise models: the edge reversal model and Gaussian edge weights model. The results provide insights into the robustness of different greedy heuristics and techniques for MAXCUT, which can be used for algorithm design of general USM problems.

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

↑