Splitting an ordering into a partition to minimize diameter

Journal of Classification

Volumn 14, Issue 1, 1997, Pages 51-74

  Alpert, Charles J ^b   Kahng, Andrew B ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b IBM AUSTIN RESEARCH LABORATORY   (United States)

Author keywords

Constrained clustering; Diameter criterion; Dynamic programming; Partition in metric space; Restricted partition; Sequencing; Seriation; Vertex ordering

Indexed keywords

EID: 0031516069     PISSN: 01764268     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003579900003     Document Type: Article

References (37)

1. ALPERT, C. J., and KAHNG, A. B. (1993), "Multi-Way Netlist Partitioning Using Spacefilling Curves," Technical Report No. #930016, University of California at Los Angeles, Computer Science Department.
2. ASANO, T., BHATTACHARYA, B. K., KEIL, J. M., and YAO, F. F. (1988), "Clustering Algorithms Based on Minimum and Maximum Spanning Trees," Proceedings of the Fourth Annual Symposium on Computational Geometry, New York: ACM Press, 252-257.
3. AVIS, D. (1986), "Diameter Partitioning," Discrete and Computational Geometry, 1, 265-276.
4. BARTHOLDI, J. J., and PLATZMAN, L. K. (1988), "Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space," Management Sciences, 34(3), 291-305.
5. BENZÉCRI, J. P. (1982), "Construction d'une Classification Ascendante Hiérarchique par la Rechereche en Chaine des Voisins Réciproques," Les Cahiers de l'Analyse des Données (VII)2, 209-218.
6. BRUCKER, P. (1978), "On the Complexity of Clustering Problems," in Optimization and Operations Research, Lecture Notes in Economics and Mathematical Systems, 157, Eds., M. Beckman and H. P. Kunzi, Heidelberg: Springer, 45-54.
7. CHAN, P. K., SCHLAG, M. D. F., and ZIEN, J. (1994), "Spectral K-Way Ratio Cut Partitioning and Clustering," IEEE Transactions on Computer-Aided Design, 13(9), 1088-1096.
8. DEFAYS, D. (1978), "A Short Note on a Method of Seriation, " British Journal of Mathematical and Statistical Psychology, 31, 49-53.
9. DELATTRE, M., and HANSEN, P. (1980), "Bicriterion Cluster Analysis," IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-2(4), 277-291.
10. FEDER, T., and GREENE, D. H. (1988), "Optimal Algorithms for Approximate Clustering," Proceedings of the Twentieth Annual ACM Symposium on the Theory of Computing, New York: ACM Press, 434-444.
11. FIEDLER, M. (1973), "Algebraic Connectivity of Graphs," Czechoslovak Mathematical Journal, 23 (98), 298-305.
12. FISHER, R. A. (1936), "The Use of Multiple Measurements in Taxonomic Problems," Annals of Eugenics, VII(II), 179-188
13. GLASBEY, C. A. (1987), "Complete Linkage as a Multiple Stopping Rule for Single Linkage Clustering," Journal of Classification, 4, 103-109.
14. GONZALEZ, T. F. (1985), "Clustering to Minimize the Maximum Intercluster Distance," Theoretical Computer Science, 38, 293-306.
15. GUÉNOCHE, A. (1993), "Enumeration des Partitions de Diamètre Minimum," Discrete Mathematics, 111, 277-287.
16. GUÉNOCHE, A., HANSEN, P., and JAUMARD, B. (1991), "Efficient Algorithms for Divisive Hierarchical Clustering with the Diameter Criterion," Journal of Classification, 8, 5-30.
17. HALL, K. M. (1970), "An r-dimensional Quadratic Placement Algorithm," Management Science, 17, 219-229.
18. HANSEN, P., and DELATTRE, M. (1978), "Complete Link Cluster Analysis by Graph Coloring," Journal of the American Statistical Association, 73, 397-403.
19. HANSEN, P., and JAUMARD, B. (1987), "Minimum Sum of Diameters Clustering," Journal of Classification, 4, 215-226.
20. HANSEN, P., JAUMARD, B., and FRANK, O. (1989), "Maximum Sum-of-Splits Clustering," Journal of Classification, 6, 177-193.
21. HANSEN, P., JAUMARD, B., and MUSITU, K. (1990), "Weight Constrained Maximum Split Clustering," Journal of Classification, 7, 217-240.
22. HERSHBERGER, J. (1991), "Minimizing the Sum of Diameters Efficiently," Proceedings of the Third Canadian Conference on Computational Geometry, 62-65.
23. HOFFMAN, M. S. (1992), Ed., The World Almanac. New York: Pharos, 209, 292-293.
24. HUBERT, L. (1973), "Monotone Invariant Clustering Procedures," Psychometrika, 38(1), 47-62.
25. HUBERT, L. J., and ARABIE, P. (1986), "Unidimensional Scaling and Combinatorial Optimization," in Multidimensional Data Analysis, Eds., J. De Leeuw, W. Heiser, J. Meulman, and F. Critchley, Leiden, The Netherlands: DSWO Press, 181-196.
26. JOHNSON, D. S. (1990), "Local Optimization and the Traveling Salesman Problem", Proceedings of the 17th International Colloquium on Automata, Languages and Programming, Ed., M. S. Paterson, Berlin: Springer-Verlag, 446-460.
27. JOHNSON, S. C. (1967), "Hierarchical Clustering Schemes," Psychometrika, 32(3), 241-254.
28. KARP, R. M. (1977), "Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane," Mathematics of Operations Research, 2(3), 209-224.
29. LIN, S. (1965), "Computer Solutions of the Traveling Salesman Problem," The Bell System Technical Journal, 44, 2245-2269.
30. LIN, S., and KERNIGHAN, B. W. (1973), "An Effective Heuristic Algorithm for the Traveling Salesman Problem with Thousands of Nodes," Operations Research, 21, 498-516.
31. MONMA, C., and SURI, S. (1991), "Partitioning Points and Graphs to Minimize the Maximum or the Sum of Diameters," Proceedings of the Sixth International Conference on the Theory and Applications of Graphs, Eds., Y. Alavi, G. Chartrand, O. R. Oellermann, and A. J. Schwenk, New York: Wiley.
32. PAPADIMITRIOU, C. H. (1992), "The Complexity of the Lin-Kernighan Heuristic for the Traveling Salesman Problem", SIAM Journal on Computing, 21(3), 450-465.
33. PLINER, V. (1986), "The Problem of Multidimensional Metric Scaling," Automation and Remote Control, 47, 560-567.
34. PLINER, V. (1996), "Metric Unidimensional Scaling and Global Optimization," Journal of Classification, 13, 3-18.
35. POTHEN, A., SIMON, H. D., AND LIOU. K.-P. (1990), "Partitioning Sparse Matrices with Eigenvectors of Graphs", SIAM Journal on Matrix Analysis and Applications, 11(3), 430-452.
36. RAO, M. R. (1971), "Cluster Analysis and Mathematical Programming," Journal of the American Statistical Association, 66(335), 622-626.
37. SUN, W., and SECHEN, C. (1993). "Efficient and Effective Placements for Very Large Circuits," Proceedings of the IEEE International Conference on Computer-Aided Design, Los Alamitos, California: IEEE Computer Society Press, 170-177.