Funder
National Natural Science Foundation of China
Grant-in-Aid for Scientific Research of the Ministry of Education, Science, Sports and Culture of Japan
Natural Sciences and Engineering Research Council of Canada
China Scholarship Council
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference19 articles.
1. Becker, R.I., Schach, S.R., Perl, Y.: A shifting algorithm for min-max tree partitioning. J. ACM 29, 58–67 (1982)
2. Chataigner, F., Salgado, L.R.B., Wakabayashi, Y.: Approximation and inapproximability results on balanced connected partitions of graphs. Dis. Math. Theor. Comput. Sci. 9, 177–192 (2007)
3. Chen, G., Chen, Y., Chen, Z.-Z., Lin, G., Liu, T., Zhang, A.: Approximation algorithms for maximally balanced connected graph tripartition problem. J. Combinat. Optim. (2020). https://doi.org/10.1007/s10878-020-00544-w
4. Chlebíková, J.: Approximating the maximally balanced connected partition problem in graphs. Inf. Process. Lett. 60, 225–230 (1996)
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge, Massachusetts (2001)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献