%0 Journal Article
%T AN APPROXIMATION ALGORITHM ON GRAPH (K,M) OPTIMAL PARTITION PROBLEM<br>图(k,m)最优划分的近似算法
%A Lu Qicheng
%A <br>吕其诚
%J 软件学报
%D 1992
%I 
%X In this paper we present an approximation algorithm for (k,m) optimal partition problem on an undirected graph. We show that this approximation algorithm which produces a near optimal solution runs in polynomial time. The performance ratio in the worst case is bounded by a parameter k, which is independent of input size of the problem.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=AA439CCD7A57092BA8F747C10B190B02&yid=F53A2717BDB04D52&vid=38B194292C032A66&iid=E158A972A605785F&sid=2A8D03AD8076A2E3&eid=EA389574707BDED3&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=6