Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain performance guarantees using local ratio techniques. Are the bounds obtained in this way tight? This problem was considered before by Karloff and by Alon and Sudakov. Here we further extend their results and show, for the first time, that the local analyses of the Goemans and Williamson MAX CUT algorithm, as well as its extension by Zwick, are tight for every possible relative size of the maximum cut. We also obtain similar results for several related problems. Our approach is quite general and could possibly be applied to some additional problems and algorithms.
机译:来自组合优化问题的SEMIDEFINITE编程放松的近似算法
机译:通过复杂的半定编程对MAX-3-CUT和其他问题的近似算法
机译:MAX 4-SAT的近似算法和半定程序的舍入过程
机译:一种区域分割技术,用于构建强大的半纤维程序的平方和近似
机译:降维的去随机化和基于半确定编程的近似算法。
机译:BWM *:一种新颖的可证明的基于集合的动态规划算法用于计算蛋白质设计的稀疏近似
机译:基于半定规划的近似算法构造最坏情况实例