暂无分享,去创建一个
[1] Francesco Maffioli,et al. On the complexity of graph tree partition problems , 2004, Discret. Appl. Math..
[2] Sanjoy Dasgupta,et al. A cost function for similarity-based hierarchical clustering , 2015, STOC.
[3] Lei Wang,et al. Hierarchical clustering algorithm for categorical data using a probabilistic rough set model , 2014, Knowl. Based Syst..
[4] Juraj Hromkovic,et al. Reoptimization of Steiner Trees , 2008, SWAT.
[5] Samuel H. Fuller,et al. Performance of height-balanced trees , 1976, CACM.
[6] Vangelis Th. Paschos,et al. Fast reoptimization for the minimum spanning tree problem , 2010, J. Discrete Algorithms.
[7] Roberto Solis-Oba,et al. A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves , 1998, Algorithmica.
[8] Mark Sh. Levin. Towards Integrated Glance To Restructuring in Combinatorial Optimization , 2015, ArXiv.
[9] Konstantin Andreev,et al. Balanced Graph Partitioning , 2004, SPAA '04.
[10] Daniel J. Kleitman,et al. Spanning Trees with Many Leaves , 1991, SIAM J. Discret. Math..
[11] Anil K. Jain,et al. Algorithms for Clustering Data , 1988 .
[12] Sagi Snir,et al. Convex recolorings of strings and trees: Definitions, hardness results and algorithms , 2008, J. Comput. Syst. Sci..
[13] Robert E. Tarjan,et al. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..
[14] Dalessandro Soares Vianna,et al. A GRASP algorithm for the multi-criteria minimum spanning tree problem , 2008, Ann. Oper. Res..
[15] Noga Alon,et al. Spanning Directed Trees with Many Leaves , 2008, SIAM J. Discret. Math..
[16] Mauro Dell'Amico,et al. Combining Linear and Non-Linear Objectives in Spanning Tree Problems , 2000, J. Comb. Optim..
[17] Panos M. Pardalos,et al. GRASP with Path Relinking for Three-Index Assignment , 2005, INFORMS J. Comput..
[18] Harald Räcke,et al. Optimal hierarchical decompositions for congestion minimization in networks , 2008, STOC.
[19] Narendra Ahuja,et al. Unsupervised multidimensional hierarchical clustering , 1998, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181).
[20] Robert E. Tarjan,et al. Edge-disjoint spanning trees and depth-first search , 1976, Acta Informatica.
[21] Chin-Wang Tao,et al. Interval competitive agglomeration clustering algorithm , 2010, Expert Syst. Appl..
[22] Mark Sh. Levin. Restructuring in Combinatorial Optimization , 2011, ArXiv.
[23] Seth Pettie,et al. An optimal minimum spanning tree algorithm , 2000, JACM.
[24] Kazuhiko Yamamoto,et al. Balancing weight-balanced trees , 2011, J. Funct. Program..
[25] Gregory Gutin,et al. Cryptographic enforcement of information flow policies without public information via tree partitions , 2016, J. Comput. Secur..
[26] Vangelis Th. Paschos,et al. Reoptimization of minimum and maximum traveling salesman's tours , 2009, J. Discrete Algorithms.
[27] Edward M. Reingold,et al. Binary Search Trees of Bounded Balance , 1973, SIAM J. Comput..
[28] D. Cook,et al. Graph-based hierarchical conceptual clustering , 2002 .
[29] Deying Li,et al. A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks , 2003, Networks.
[30] Horst W. Hamacher,et al. On spanning tree problems with multiple objectives , 1994, Ann. Oper. Res..
[31] R. Ravi,et al. Approximating Maximum Leaf Spanning Trees in Almost Linear Time , 1998, J. Algorithms.
[32] Shane Dye. A note on the minimum bounded edge-partition of a tree , 2009, Discret. Appl. Math..
[33] Anil K. Jain,et al. Data clustering: a review , 1999, CSUR.
[34] J. Storer. An Introduction to Data Structures and Algorithms , 2002, Birkhäuser Boston.
[35] Bill Jackson,et al. Independence free graphs and vertex connectivity augmentation , 2005, J. Comb. Theory, Ser. B.
[36] Henning Fernau,et al. An exact algorithm for the Maximum Leaf Spanning Tree problem , 2009, Theor. Comput. Sci..
[37] Mark Sh. Levin. Towards Design of System Hierarchy (research survey) , 2012, ArXiv.
[38] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[39] Yu-Chee Tseng,et al. Balanced Spanning Trees in Complete and Incomplete Star Graphs , 1996, IEEE Trans. Parallel Distributed Syst..
[40] Mark Sh. Levin. Towards balanced clustering - part 1 (preliminaries) , 2017, ArXiv.
[41] Alon Itai,et al. The Multi-Tree Approach to Reliability in Distributed Networks , 1984, Inf. Comput..
[42] Mark Sh. Levin. Multiset Estimates and Combinatorial Synthesis , 2012, ArXiv.
[43] Yan Zhou,et al. Minimum Spanning Tree Based Clustering Algorithms , 2006, 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06).
[44] Shaojie Tang,et al. Primal dual based algorithm for degree-balanced spanning tree problem , 2018, Appl. Math. Comput..
[45] Gábor J. Székely,et al. Hierarchical Clustering via Joint Between-Within Distances: Extending Ward's Minimum Variance Method , 2005, J. Classif..
[46] Amitabh Sinha,et al. Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem , 2005, Algorithmica.
[47] Mark Sh. Levin. Combinatorial clustering: Literature review, methods, examples , 2015, Journal of Communications Technology and Electronics.
[48] Robert E. Tarjan,et al. Finding Minimum Spanning Trees , 1976, SIAM J. Comput..
[49] Francesco Maffioli,et al. On the complexity of finding multi-constrained spanning trees , 1983, Discret. Appl. Math..
[50] Alfred V. Aho,et al. Data Structures and Algorithms , 1983 .
[51] Philip M. Long,et al. Performance guarantees for hierarchical clustering , 2002, J. Comput. Syst. Sci..
[52] Justo Puerto,et al. Algorithms for uniform centered partitions of trees , 2016, Electron. Notes Discret. Math..
[53] Chung-Horng Lung,et al. Using Hierarchical Agglomerative Clustering in Wireless Sensor Networks: An Energy-Efficient and Flexible Approach , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.
[54] Maria Grazia Speranza,et al. Reoptimizing the rural postman problem , 2013, Comput. Oper. Res..
[55] M. AdelsonVelskii,et al. AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION , 1963 .
[56] Rajmohan Rajaraman,et al. A general approach for incremental approximation and hierarchical clustering , 2006, SODA '06.
[57] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[58] A. Frank. Connections in Combinatorial Optimization , 2011 .
[59] William L. Maxwell,et al. Theory of scheduling , 1967 .
[60] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[61] Tetsuo Asano,et al. Clustering algorithms based on minimum and maximum spanning trees , 1988, SCG '88.
[62] Stephen R. Schach,et al. Max-Min Tree Partitioning , 1981, JACM.
[63] Justo Puerto,et al. Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs , 2008, Networks.
[64] Kurt Mehlhorn,et al. On the Average Number of Rebalancing Operations in Weight-Balanced Trees , 1980, Theor. Comput. Sci..
[65] S. A. Choudum,et al. Embedding height balanced trees and Fibonacci trees in hypercubes , 2009 .
[66] Mark Sh. Levin. Towards hierarchical clustering , 2007 .
[67] Kazuhisa Makino,et al. A TREE PARTITIONING PROBLEM ARISING FROM AN EVACUATION PROBLEM IN TREE DYNAMIC NETWORKS , 2005 .
[68] Ding-Zhu Du,et al. Connected Dominating Sets in Wireless Networks with Different Transmission Ranges , 2007, IEEE Transactions on Mobile Computing.
[69] Petr A. Golovach,et al. Structured Connectivity Augmentation , 2018, SIAM J. Discret. Math..
[70] Beat Gfeller. Faster Swap Edge Computation in Minimum Diameter Spanning Trees , 2008, ESA.
[71] Hsueh-I Lu,et al. The Power of Local Optimization: Approximation Algorithms for Maximum-Leaf Spanning Tree , 2007 .
[72] Mark Sh. Levin,et al. On Balanced Clustering (Indices, Models, Examples) , 2017 .
[73] Tamir Tassa,et al. A hierarchical clustering algorithm based on the Hungarian method , 2008, Pattern Recognit. Lett..
[74] Seth Pettie,et al. A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest , 1999, RANDOM-APPROX.
[75] Alok Singh,et al. An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem , 2009, Appl. Soft Comput..
[76] Mark Sh. Levin. Towards combinatorial clustering: preliminary research survey , 2015, ArXiv.
[77] Mark Sh. Levin. Modular System Design and Evaluation , 2014 .
[78] Xiuzhen Cheng,et al. Connected Dominating Set in Sensor Networks and MANETs , 2004 .
[79] W. Y. Szeto,et al. Solving a static repositioning problem in bike-sharing systems using iterated tabu search , 2014 .
[80] Robert E. Tarjan,et al. Augmentation Problems , 1976, SIAM J. Comput..
[81] Arne Andersson. General Balanced Trees , 1999, J. Algorithms.
[82] Robert E. Tarjan,et al. Dominator Tree Certification and Independent Spanning Trees , 2012, ArXiv.
[83] Yehoshua Perl,et al. The Shifting Algorithm Technique for the Partitioning of Trees , 1995, Discret. Appl. Math..
[84] Peter Sanders,et al. Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering , 2016, Journal of Heuristics.
[85] Raphael Yuster,et al. Connected Domination and Spanning Trees with Many Leaves , 2000, SIAM J. Discret. Math..
[86] Adrian Vetta,et al. An approximation algorithm for the maximum leaf spanning arborescence problem , 2010, TALG.
[87] Moses Charikar,et al. Approximate Hierarchical Clustering via Sparsest Cut and Spreading Metrics , 2016, SODA.
[88] Huowang Chen,et al. The multi-criteria minimum spanning tree problem based genetic algorithm , 2007, Inf. Sci..
[89] Luca Foschini,et al. Balanced Partitions of Trees and Applications , 2012, Algorithmica.