Outward rotations
Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems. We present a tool, outward rotations, for enhancing the performance of several semidefinite programming based approximation algorithms. Using outward rotations, we obtain an approximation algorithm for MAX CUT that, in many interesting cases, performs better than the algorithm of Goemans and Williamson. We also obtain an improved approximation algorithm for MAX NAE-f3g-SAT. Finally, we provide some evidence that outward rotations can also be used to obtain improved approximation algorithms for MAX NAE-SAT and MAX SAT. 1 Introduction MAX CUT is perhaps the simplest and most natural APX-complete constraint satisfaction problem (see, e.g., [AL97]). There are various simple ways of obtaining a performance guarantee of 1/2 for the problem. One of them, for example, is just choosing a random cut. No performance guarantee better than 1/2 was known for the problem until Goemans and Williamson [GW95], in a major breakthrough, used semidefinite programming to obtain an approximation algorithm ...
This software is also peer reviewed by journal TOMS.
This software is also peer reviewed by journal TOMS.
Keywords for this software
References in zbMATH (referenced in 45 articles )
Showing results 1 to 20 of 45.
Sorted by year (- O’Donnell, Ryan; Schramm, Tselil: Sherali-Adams strikes back (2021)
- Newman, Alantha: Complex semidefinite programming and Max-(k)-Cut (2018)
- Feuerstein, Esteban; Marchetti-Spaccamela, Alberto; Schalekamp, Frans; Sitters, René; van der Ster, Suzanne; Stougie, Leen; van Zuylen, Anke: Minimizing worst-case and average-case makespan over scenarios (2017)
- Xian, Aiyong; Zhu, Kaiyuan; Zhu, Daming; Pu, Lianrong; Liu, Hong: Approximating Max NAE-(k)-SAT by anonymous local search (2017)
- Wu, Chenchen; Xu, Dachuan; Du, Donglei; Xu, Wenqing: An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (2016)
- Xian, Aiyong; Zhu, Kaiyuan; Zhu, Daming; Pu, Lianrong: Local search to approximate MAX NAE-(k)-SAT tightly (2015)
- d’Aspremont, Alexandre; Bach, Francis; El Ghaoui, Laurent: Approximation bounds for sparse principal component analysis (2014)
- Nederlof, Jesper; van Rooij, Johan M. M.; van Dijk, Thomas C.: Inclusion/exclusion meets measure and conquer (2014)
- Xu, BaoGang; Yu, XingXing; Zhang, XiaoYan; Zhang, Zan-Bo: An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (2014)
- Xu, Zi; Du, Donglei; Xu, Dachuan: Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems (2014)
- Feige, Uriel; Immorlica, Nicole; Mirrokni, Vahab S.; Nazerzadeh, Hamid: PASS approximation: a framework for analyzing and designing heuristics (2013)
- Kim, Eun Jung; Williams, Ryan: Improved parameterized algorithms for above average constraint satisfaction (2012)
- Ling, Ai-fan; Xu, Cheng-xian: A new discrete filled function method for solving large scale max-cut problems (2012)
- Wu, Chenchen; Xu, Dachuan; Zhao, Xin-Yuan: An improved approximation algorithm for the (2)-catalog segmentation problem using semidefinite programming relaxation (2012)
- Wu, Z. Y.; Li, G. Q.; Quan, J.: Global optimality conditions and optimization methods for quadratic integer programming problems (2011)
- Ling, Aifan; Tang, Le; Xu, Chengxian: Approximation algorithms for MAX RES CUT with limited unbalanced constraints (2010)
- Chen, Jianer; Lu, Songjian: Improved parameterized set splitting algorithms: A Probabilistic approach (2009)
- Ling, Ai-Fan; Xu, Cheng-Xian; Xu, Feng-Min: A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems (2009)
- Anjos, Miguel F.: An extended semidefinite relaxation for satisfiability (2008)
- Ling, Ai-Fan; Xu, Cheng-Xian; Xu, Feng-Min: A discrete filled function algorithm for approximate global solutions of max-cut problems (2008)