Author:
Li Yajie,Li Weidong,Liu Xiaofei,Yang Jinhua
Publisher
Springer International Publishing
Reference30 articles.
1. Becker, R., Lari, I., Lucertini, M., Simeone, B.: Max-min partitioning of grid graphs into connected components. Networks 32, 115–125 (1998)
2. Becker, R., Lari, I., Lucertini, M., Simeone, B.: A polynomial-time algorithm for max-min partitioning of ladders. Theory Comput. Syst. 34, 353–374 (2001)
3. Becker, R., Perl, Y.: Shifting algorithms for tree partitioning with general weighting functions. J. Algorithms 4(2), 101–120 (1983)
4. Chataigner, F., Salgado, L., Wakabayashi, Y.: Approximation and inapproximability results on balanced connected partitions of graphs. Discrete Math. Theor. Comput. Sci. 9, 177–192 (2007)
5. Chen, G., Chen, Y., Chen, Z.-Z., Lin, G., Liu, T., Zhang, A.: Approximation algorithms for the maximally balanced connected graph tripartition problem. J. Comb. Optim., 1–21 (2020). https://doi.org/10.1007/s10878-020-00544-w
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献