Publisher
Springer International Publishing
Reference22 articles.
1. Alimonti, P., Calamoneri, T.: On the complexity of the max balance problem. In: Argentinian Workshop on Theoretical Computer Science (WAIT 1999), pp. 133–138 (1999)
2. Becker, R., Lari, I., Lucertini, M., Simeone, B.: A polynomial-time algorithm for max-min partitioning of ladders. Theory Comput. Syst. 34(4), 353–374 (2001). https://doi.org/10.1007/s00224-001-0008-8
3. Becker, R.I., Lari, I., Lucertini, M., Simeone, B.: Max-min partitioning of grid graphs into connected components. Networks 32(2), 115–125 (1998)
4. Becker, R.I., Perl, Y.: Shifting algorithms for tree partitioning with general weighting functions. J. Algorithms 4(2), 101–120 (1983)
5. Becker, R.I., Schach, S.R., Perl, Y.: A shifting algorithm for min-max tree partitioning. J. ACM 29(1), 58–67 (1982)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献