Sortability of vector partitions

Discrete Mathematics

Volumn 263, Issue 1-3, 2003, Pages 129-142

  Hwang, F K ^a   Lee, J S ^a   Liu, Y C ^a   Rothblum, U G ^b  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Clustering; Enumeration; Partition; Sortability

Indexed keywords

EID: 84867950462     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00527-7     Document Type: Article

References (9)

1. N. Alon, S. Onn, Separable partitions, Discrete Appl. Math. 91 (1999) 39-51.
2. S. Aviran, N. Lev-Tov, S. Onn, U.G. Rothblum, Vertex characterization ofpartition polytopes ofplanar point sets, Discrete Appl. Math., to appear.
3. E.R. Barnes, A.J. HoKman, R.G. Rothblum, An optimal partitions having disjoint convex and conic hulls, Math. Programming 54 (1992) 69-86.
4. E. Boros, P.L. Hammer, On clustering problems with connected optima in Euclidean spaces, Discrete Math. 75 (1989) 81-88.
5. E. Boros, F.K. Hwang, Optimality ofnested partitions and its application to cluster analysis, SIAM J. Optim. 6 (1996) 1153-1162.
6. V. Capoyleas, G. Rote, G. Woeginger, Geometric clusterings, J. Algorithms 12 (1991) 69-86.
7. G.J. Chang, F.L. Chen, L.L. Huang, F.K. Hwang, S.T. Nuan, U.G. Rothblum, I.F. Sun, J.W. Wang, H.G. Yeh, Sortabilities ofpartition properties, J. Combin. Optim. 2 (1999) 413-427.
8. F.K. Hwang, S. Onn, U.G. Rothblum, A polynomial time algorithm for shaped partition problems, SIAM J. Optim. 10 (1999) 70-81.
9. F.K. Hwang, U.G. Rothblum, Y.C. Yao, Localizing combinatorial properties ofpartitions, Discrete Math. 160 (1996) 1-23.