文章基本信息

标题：A Note on Approximating MAX-BISECTION on Regular Graphs
本地全文：下载
作者：Uriel Feige ; Marek Karpinski ; Michael Langberg 等
期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2000
卷号：2000
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：We design a 0795 approximation algorithm for the Max-Bisection problem restricted to regular graphs. In the case of three regular graphs our results imply an approximation ratio of 0834.
关键词：Approximation Algorithms, Approximation Ratios, derandomization, MAX-BISECTION, Max-Cut, NP-hardness, random graphs, Regular Graphs, Semidefinite programming