期刊
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC
卷 53, 期 2, 页码 169-185出版社
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jalgor.2004.06.001
关键词
-
We present an improved semidefinite programming based approximation algorithm for the MAX CUT problem in graphs of maximum degree at most 3. The approximation ratio of the new algorithm is at least 0.9326. This improves, and also somewhat simplifies, a result of Feige, Karpinski and Langberg. We also observe that results of Hopkins and Staton and of Bondy and Locke yield a simple combinatorial 4/5-approximation algorithm for the problem. Finally, we present a combinatorial 22/27-approximation algorithm for the MAX CUT problem for regular cubic graphs. (C) 2004 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据