Year: 2003
Author: Da-Chuan Xu, Ji-Ye Han
Journal of Computational Mathematics, Vol. 21 (2003), Iss. 3 : pp. 357–366
Abstract
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.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2003-JCM-10264
Journal of Computational Mathematics, Vol. 21 (2003), Iss. 3 : pp. 357–366
Published online: 2003-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 10
Keywords: Approximation algorithm Max-Bisection problem Semidefinite programming Approximation ratio.