%0 Journal Article %1 goemans95 %A Goemans, Michel X. %A Williamson, David P. %C New York, NY, USA %D 1995 %I ACM %J J. ACM %K algorithm approximation graph.theory max-cut randomized %N 6 %P 1115--1145 %R 10.1145/227683.227684 %T Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming %V 42

@article{goemans95, acmid = {227684}, added-at = {2016-04-18T07:28:22.000+0200}, address = {New York, NY, USA}, author = {Goemans, Michel X. and Williamson, David P.}, biburl = {https://www.bibsonomy.org/bibtex/28088d4ec951191cd125f80e1c25c1557/ytyoun}, doi = {10.1145/227683.227684}, interhash = {107cf31fb64bdf9bdc96517db281ca34}, intrahash = {8088d4ec951191cd125f80e1c25c1557}, issn = {0004-5411}, issue_date = {Nov. 1995}, journal = {J. ACM}, keywords = {algorithm approximation graph.theory max-cut randomized}, month = nov, number = 6, numpages = {31}, pages = {1115--1145}, publisher = {ACM}, timestamp = {2016-04-19T15:17:27.000+0200}, title = {Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming}, volume = 42, year = 1995 }