Funder
National Natural Science Foundation of China
China Scholarship Council
Natural Sciences and Engineering Research Council of Canada
The Grant in aid for Scientific Research of the Ministry of Education, Science, Sports and Culture of Japan
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference24 articles.
1. An Z, Feng Q, Kanj I, Xia G (2017) The complexity of tree partitioning. In: Proceedings of WADS 2017, pp 37–48
2. Andersson M, Gudmundsson J, Levcopoulos C, Narasimhan G (2003) Balanced partition of minimum spanning trees. Int J Comput Geometry Appl 13:303–316
3. Becker RI, Schach SR, Perl Y (1982) A shifting algorithm for min-max tree partitioning. JACM 29:58–67
4. Caraballo LE, Diaz-Banez JM, Kroher N (2018) A polynomial algorithm for balanced clustering via graph partitioning. arXiv:1801.03347
5. Chataigner F, Salgado LRB, Wakabayashi Y (2007) Approximation and inapproximability results on balanced connected partitions of graphs. Discrete Math Theor Comput Sci 9:177–192
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献