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 条

[21] A tight semidefinite relaxation of the MAX CUT problem
Liu, HW
Liu, SY
Xu, FM
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2003, 7 (03) : 237 - 245
[22] A Tight Semidefinite Relaxation of the MAX CUT Problem
Hongwei Liu
Sanyang Liu
Fengmin Xu
[J]. Journal of Combinatorial Optimization, 2003, 7 : 237 - 245
[23] A Hybridization between Memetic Algorithm and Semidefinite Relaxation for the Max-Cut Problem
Song, Bo
Li, Victor O. K.
[J]. PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2012, : 425 - 432
[24] An improved kernel for Max-Bisection above tight lower bound
Feng, Qilong
Zhu, Senmin
Wang, Jianxin
[J]. THEORETICAL COMPUTER SCIENCE, 2020, 818 (818) : 12 - 21
[25] Approximation bounds for semidefinite relaxation of max-min-fair multicast transmit beamforming problem
Chang, Tsung-Hui
Luo, Zhi-Quan
Chi, Chong-Yung
[J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2008, 56 (08) : 3932 - 3943
[26] A multiple penalty function method for solving Max-Bisection problems
Xu, FM
Xu, CX
Xue, HG
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2006, 173 (02) : 757 - 766
[27] EMPLOYING PLSA MODEL AND MAX-BISECTION FOR REFINING IMAGE ANNOTATION
Tian, Dongping
Zhang, Wenbo
Zhao, Xiaofei
Shi, Zhongzhi
[J]. 2013 20TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP 2013), 2013, : 3996 - 4000
[28] A Parallel Approximation Algorithm for Positive Semidefinite Programming
Jain, Rahul
Yao, Penghui
[J]. 2011 IEEE 52ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2011), 2011, : 463 - 471
[29] MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs
Diaz, Josep
Kaminski, Marcin
[J]. THEORETICAL COMPUTER SCIENCE, 2007, 377 (1-3) : 271 - 276
[30] A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem
Wu, Chenchen
Xu, Dachuan
Du, Donglei
Xu, Wen-qing
[J]. COMPUTING AND COMBINATORICS, COCOON 2014, 2014, 8591 : 324 - 335

← 1 2 3 4 5 →