Approximation algorithm for Max-Bisection problem with the positive semidefinite relaxation
文献类型：期刊论文
| 作者 | Xu, DC; Han, JY |
| 刊名 | JOURNAL OF COMPUTATIONAL MATHEMATICS
 |
| 出版日期 | 2003-05-01 |
| 卷号 | 21期号:3页码:357-366 |
| 关键词 | approximation algorithm Max-Bisection problem semidefinite programming approximation ratio |
| ISSN号 | 0254-9409 |
| 英文摘要 | Using outward rotations, we obtain an approximation algorithm for Max-Bisection problem, i.e., partitioning the vertices of an undirected graph into two blocks of equal cardinality so as to maximize the weights of crossing edges. In many interesting cases, the algorithm performs better than the algorithms of Ye and of Halperin and Zwick. The main tool used to obtain this result is semidefinite programming. |
| WOS研究方向 | Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000183218200011 |
| 出版者 | VSP BV |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/18028]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 作者单位 | Chinese Acad Sci, Acad Math & Syst Sci, Inst Appl Math, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Xu, DC,Han, JY. Approximation algorithm for Max-Bisection problem with the positive semidefinite relaxation[J]. JOURNAL OF COMPUTATIONAL MATHEMATICS,2003,21(3):357-366. |
| APA | Xu, DC,&Han, JY.(2003).Approximation algorithm for Max-Bisection problem with the positive semidefinite relaxation.JOURNAL OF COMPUTATIONAL MATHEMATICS,21(3),357-366. |
| MLA | Xu, DC,et al."Approximation algorithm for Max-Bisection problem with the positive semidefinite relaxation".JOURNAL OF COMPUTATIONAL MATHEMATICS 21.3(2003):357-366. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。