arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0811.3244cs.DScs.DM
收藏

Gale-Berlekamp对策及相关极小化问题的线性时间逼近格式

Linear Time Approximation Schemes for the Gale-Berlekamp Game and Related Minimization Problems

Marek Karpinski, Warren Schudy

摘要:

我们为Gale-Berlekamp切换博弈设计了一个线性时间近似方案,并将其推广到更广泛的一类稠密脆弱最小化问题,包括最近码字问题(NCP)和唯一博弈问题。另外的应用尤其包括找到矩阵刚性的约束形式和纠错码的最大似然解码。作为我们方法的另一个应用,我们给出了具有固定簇数的相关聚类的第一线性时间近似方案及其层次推广。我们的研究结果依赖于一种新的技术,用于处理小目标函数值的优化问题,并可能是独立的利益。

英文摘要:

We design a linear time approximation scheme for the Gale-Berlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest Codeword Problem (NCP) and Unique Games Problem. Further applications include, among other things, finding a constrained form of matrix rigidity and maximum likelihood decoding of an error correcting code. As another application of our method we give the first linear time approximation schemes for correlation clustering with a fixed number of clusters and its hierarchical generalization. Our results depend on a new technique for dealing with small objective function values of optimization problems and could be of independent interest.

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

↑