|
|||||
|
|
Approximation algorithms for the maximally balanced connected graph tripartition problem |
|
| Authors: | Chen Guangting Chen Yong Chen Zhi-Zhong Lin Guohui Liu Tian Zhang An |
| Institution: | 1.Department of Mathematics, Taizhou University, Linhai, China ;2.Department of Mathematics, Hangzhou Dianzi University, Hangzhou, China ;3.Division of Information System Design, Tokyo Denki University, Saitama, Japan ;4.Department of Computing Science, University of Alberta, Edmonton, Canada ;5.School of EECS, Peking University, Beijing, China ; |
| Abstract: | Journal of Combinatorial Optimization - Given a vertex-weighted connected graph $$G = (V, E, w(\cdot ))$$ , the maximally balanced connected graph k-partition (k-BGP) seeks to partition the vertex... |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |