On finding connected balanced partitions of trees
暂无分享,去创建一个
Roberto Cordone | Andrea Scozzari | Maurizio Bruglieri | Isabella Lari | Federica Ricca | R. Cordone | I. Lari | F. Ricca | A. Scozzari | M. Bruglieri
[1] Isabella Lari,et al. Computing sharp bounds for hard clustering problems on trees , 2009, Discret. Appl. Math..
[2] Roberto Cordone,et al. Partitioning a graph into minimum gap components , 2016, Electron. Notes Discret. Math..
[3] B. Simeone,et al. Clustering on trees , 1997 .
[4] P. Hammer,et al. Order Relations of Variables in 0-1 Programming , 1987 .
[5] Dorit S. Hochbaum. Algorithms and Complexity of Range Clustering , 2019, Networks.
[6] Justo Puerto,et al. Algorithms for uniform centered partitions of trees , 2016, Electron. Notes Discret. Math..
[7] Marcello Vitaletti,et al. Optimal Design of District Metered Areas in Water Distribution Networks , 2014 .
[8] Justo Puerto,et al. Uniform and most uniform partitions of trees , 2018, Discret. Optim..
[9] Alfeu Sá Marques,et al. Different Design Criteria for District Metered Areas in Water Distribution Networks , 2015 .
[10] Justo Puerto,et al. Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria , 2016, Networks.
[11] Víctor M. Albornoz,et al. Integrated versus hierarchical approach for zone delineation and crop planning under uncertainty , 2020, Ann. Oper. Res..
[12] Justo Puerto,et al. Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs , 2008, Networks.
[13] Andranik Mirzaian,et al. Selection in X+Y and Matrices With Sorted Rows and Columns , 1985, Inf. Process. Lett..