Approximation algorithm for Max-Bisection problem with the positive semidefinite relaxation

被引：0

作者：

Xu, DC ^{[1
]}

Han, JY ^{[1
]}

机构：

[1] Chinese Acad Sci, Acad Math & Syst Sci, Inst Appl Math, Beijing 100080, Peoples R China

来源：

JOURNAL OF COMPUTATIONAL MATHEMATICS | 2003年 / 21卷 / 03期

关键词：

approximation algorithm; Max-Bisection problem; semidefinite programming; approximation ratio;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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.

引用

页码：357 / 366

页数：10

共 50 条

[1] APPROXIMATION ALGORITHM FOR MAX-BISECTION PROBLEM WITH THE POSITIVE SEMIDEFINITE RELAXATION
Da-chuan Xu Ji-ye Han(Institute of Applied Mathematics
[J]. Journal of Computational Mathematics, 2003, (03) : 357 - 366
[2] A .699-approximation algorithm for Max-Bisection
Ye, YY
[J]. MATHEMATICAL PROGRAMMING, 2001, 90 (01) : 101 - 111
[3] A .699-approximation algorithm for Max-Bisection
Yinyu Ye
[J]. Mathematical Programming, 2001, 90 : 101 - 111
[4] An Efficient Memetic Algorithm for the Max-Bisection Problem
Lin, Geng
Zhu, Wenxing
[J]. IEEE TRANSACTIONS ON COMPUTERS, 2014, 63 (06) : 1365 - 1376
[5] SPEEDING UP A MEMETIC ALGORITHM FOR THE MAX-BISECTION PROBLEM
Zhu, Wenxing
Liu, Yanpo
Lin, Geng
[J]. NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION, 2015, 5 (02): : 151 - 168
[6] A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF MAX-BISECTION
Mu Xuewen~1 Zhang Yaling~2 Liu Sanyang~1 1 Dept.of Appl.Math.
[J]. Applied Mathematics:A Journal of Chinese Universities, 2007, (04) : 434 - 440
[7] A successive quadratic programming algorithm for SDP relaxation of Max-Bisection
Mu X.
Zhang Y.
Liu S.
[J]. Applied Mathematics-A Journal of Chinese Universities, 2007, 22 (4) : 434 - 440
[8] A deterministic annealing algorithm for approximating a solution of the max-bisection problem
Dang, CY
He, LP
Hui, IK
[J]. NEURAL NETWORKS, 2002, 15 (03) : 441 - 458
[9] Memetic search for the max-bisection problem
Wu, Qinghua
Hao, Jin-Kao
[J]. COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (01) : 166 - 179
[10] A more efficient deterministic annealing neural network algorithm for the max-bisection problem
Jiang, Shicong
Dang, Chuangyin
[J]. NEUROCOMPUTING, 2021, 458 : 428 - 439

← 1 2 3 4 5 →