摘要
研究对象仅限于平面图的最小对分问题 ,研究方法是借鉴U .Feige和R .Krauthgamer的“分解 -组合”思想 ;在算法的设计上有新的较大的改进 。
The research object is limited to the minimum bisection problem in planar graphs. The idea of “decomposition combination” owing to U. Feige and R. Krauthgamer is used for reference. However, there are new preferable improvements in designing the algorithm;also a better approximation ratio, O (log n ), is achieved.
出处
《山东大学学报（理学版）》
CAS
CSCD
北大核心
2003年第1期5-8,共4页
Journal of Shandong University(Natural Science)
