Uniform and most uniform partitions of trees
暂无分享,去创建一个
Justo Puerto | Andrea Scozzari | Isabella Lari | Federica Ricca | J. Puerto | I. Lari | F. Ricca | A. Scozzari
[1] Ameer Ahmed Abbasi,et al. A survey on clustering algorithms for wireless sensor networks , 2007, Comput. Commun..
[2] Justo Puerto,et al. Reliability problems in multiple path-shaped facility location on networks , 2014, Discret. Optim..
[3] Bruno Simeone,et al. Local search algorithms for political districting , 2008, Eur. J. Oper. Res..
[4] B. Simeone,et al. Clustering on trees , 1997 .
[5] Yehoshua Perl,et al. The Shifting Algorithm Technique for the Partitioning of Trees , 1995, Discret. Appl. Math..
[6] Ronald I. Becker,et al. A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders , 2001, Theory of Computing Systems.
[7] Nimrod Megiddo,et al. New Results on the Complexity of p-Center Problems , 1983, SIAM J. Comput..
[8] Justo Puerto,et al. Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria , 2016, Networks.
[9] Oded Berman,et al. Facility Reliability Issues in Network p-Median Problems: Strategic Centralization and Co-Location Effects , 2007, Oper. Res..
[10] Yehoshua Perl,et al. Most Uniform Path Partitioning and its Use in Image Processing , 1993, Discret. Appl. Math..
[11] Uzi Vishkin,et al. Efficient implementation of a shifting algorithm , 2018, Discret. Appl. Math..
[12] Stephen R. Schach,et al. Max-Min Tree Partitioning , 1981, JACM.
[13] Pierre Hansen,et al. Maximum Split Clustering Under Connectivity Constraints , 1993, J. Classif..
[14] Bang Ye Wu,et al. Fully Polynomial-Time Approximation Schemes for the Max-Min Connected Partition Problem on Interval Graphs , 2012, Discret. Math. Algorithms Appl..
[15] Yehoshua Perl,et al. A Shifting Algorithm for Constrained min-max Partition on Trees , 1993, Discret. Appl. Math..
[16] Ronald I. Becker,et al. Max-min partitioning of grid graphs into connected components , 1998 .
[17] Takehiro Ito,et al. Partitioning a Weighted Tree into Subtrees with Weights in a Given Range , 2010, Algorithmica.
[18] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[19] Ameur Soukhal,et al. Preprocessing for a map sectorization problem by means of mathematical programming , 2013, Annals of Operations Research.
[20] Justo Puerto,et al. Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs , 2008 .
[21] Michalis Vazirgiannis,et al. Clustering and Community Detection in Directed Networks: A Survey , 2013, ArXiv.
[22] Gilbert Laporte,et al. A tabu search heuristic and adaptive memory procedure for political districting , 2003, Eur. J. Oper. Res..
[23] Takehiro Ito,et al. Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size , 2006, J. Discrete Algorithms.
[24] Janka Chlebíková,et al. Approximating the Maximally Balanced Connected Partition Problem in Graphs , 1996, Inf. Process. Lett..
[25] Sankar K. Pal,et al. Incorporating local image structure in normalized cut based graph partitioning for grouping of pixels , 2013, Inf. Sci..