Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference28 articles.
1. Becker R, Lari I, Lucertini M, Simeone B (1998) Max-min partitioning of grid graphs into connected components. Networks 32:115–125
2. Becker R, Lari I, Lucertini M, Simeone B (2001) A polynomial-time algorithm for max-min partitioning of ladders. Theory Comput Syst 34:353–374
3. Becker R, Perl Y (1983) Shifting algorithms for tree partitioning with general weighting functions. J Algorithms 4:101–120
4. Chataigner F, Salgado L, Wakabayashi Y (2007) Approximation and inapproximability results on balanced connected partitions of graphs. Discrete Math Theor Comput Sci 9:177–192
5. Chen G, Chen Y, Chen Z, Lin G, Liu T, Zhang A (2020) Approximation algorithms for the maximally balanced connected graph tripartition problem. J Comb Optim. https://doi.org/10.1007/s10878-020-00544-w