Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming：（改进的近似算法使用半定规划最大的削减和可满足性问题）.pdfVIP

Copyright 1995 by the Association for Computing Machinery,Inc. Permission to make digital or hard copies of part or all of thiswork for personal or classroom use is granted without fee providedthat copies are not made or distributed for profit or commercialadvantage and that copies bear this notice and the full citation onthe first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Reques