| 限定顶点个数为p的最大割问题的一种近似算法 |
| |
| 引用本文： | 王莲花,刚毅. 限定顶点个数为p的最大割问题的一种近似算法[J]. 山西大同大学学报(自然科学版), 2008, 24(6): 7-9 |
| |
| 作者姓名： | 王莲花 刚毅 |
| |
| 作者单位： | 运城学院应用数学系,山西运城,044000 |
| |
| 摘 要： | 给出了求解限定顶点个数为P的最大割问题的一种近似算法，讨论了它的性能保证，利用Pipage技术，为最大割问题设计出了0．5-近似算法．
|
| 关 键 词： | 最大割近似算法 ε-凸性 |
An Approximate Method for Max Cut with Given Size of Parts |
| |
| WANG Lian-hua,Gang Yi. An Approximate Method for Max Cut with Given Size of Parts[J]. Journal of Shanxi Datong University(Natural Science Edition), 2008, 24(6): 7-9 |
| |
| Authors: | WANG Lian-hua Gang Yi |
| |
| Affiliation: | (Department of Applied Mathematics, Yuncheng College, Yuncheng Shanxi, 044000) |
| |
| Abstract: | A new approximate method is presented for max cut with given size of parts, and its performance guarantee is analysed. By using the Pipage technique , a 0.5-approximate algorithm is presented. |
| |
| Keywords: | max cut approximate method convexity |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
