Dynamic digraph connectivity hastens minimum sum-of-diameters clustering

SIAM Journal on Discrete Mathematics

Volumn 18, Issue 2, 2004, Pages 272-286

  Ramnath, Sarnath ^a  

^a ST CLOUD STATE UNIVERSITY   (United States)

Author keywords

Dynamic digraph connectivity; Semionline algorithms; Sum of diameters clustering

Indexed keywords

CLUSTERING; DYNAMIC DIGRAPH CONNECTIVITY; SEMIONLINE ALGORITHMS; SUM-OF-DIAMETERS;

ALGORITHMS; APPROXIMATION THEORY; DATA STRUCTURES; DYNAMICS; PROBLEM SOLVING; SET THEORY;

GRAPH THEORY;

EID: 18744405095     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480102396099     Document Type: Article

References (15)

1. B. ASPVALL, M. F. PLASS, AND R. E. TARJAN, A linear-time algorithm for testing the truth of certain quantified Boolean formulas, Inform. Process. Lett., 8 (1979), pp. 121-123.
2. P. BRUCKER, On the complexity of clustering problems, optimization and operations research, in Optimization and Operations Research, Lecture Notes in Econom. and Math. Systems 157, Springer-Verlag, Berlin, New York, 1978, pp. 45-54.
3. S. CICERONE, D. FRIGIONI, U. NANNI, AND F. PUGLIESE, A uniform approach to semi-dynamic problems on digraphs, Theoret. Comput. Sci., 203 (1998), pp. 69-90.
4. R. M. CORMACK, A review of classification, J. Roy. Statist. Soc. Ser. A, 134 (1971), pp. 321-367.
5. M. DELATTRE AND P. HANSEN, Bicriterion cluster analysis, IEEE Trans. Pattern Analysis Machine Intelligence, PAMI-2(4), 1980, pp. 277-291.
6. 2) barrier, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, Redondo Beach, CA, 2000, pp. 381-389.
7. D. DOBKIN AND S. SURI, Maintenance of geometric extrema, J. ACM, 38 (1991), pp. 275-298.
8. S. R. DODDI, M. V. MARATHE, S. S. RAVI, D. S. TAYLOR, AND P. WIDMAYER, Approximation algorithms for clustering to minimize the sum of diameters, Nordic J. Comput., 7 (2000), pp. 185-203.
9. P. HANSEN AND B. JAUMARD, Minimum sum of diameters clustering, J. Classification, 4 (1987), pp. 215-226.
10. P. HANSEN AND B. JAUMARD, Cluster analysis and mathematical programming, Math. Programming, 79 (1997), pp. 191-215.
11. S. KHANNA, R. MOTWANI, AND R. H. WILSON, On certificates and lookahead on dynamic graph problems, in Proceedings of the Seventh ACM-SIAM Symposium on Discrete Algorithms, Atlanta, GA, 1996, pp. 222-231.
12. V. KING, Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs, in Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, 1999, New York, pp. 81-91.
13. V. KING AND G. SAGERT, Fully dynamic algorithm for maintaining the transitive closure, in Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, Atlanta, GA, 1999, pp. 492-498.
14. C. MONMA AND S. SURI, Partitioning points and graphs to minimize the maximum or the sum of diameters, in Proceedings of the 6th International Conference on Theory and Applications of Graphs, Kalamazoo, MI, 1989, pp. 899-912.
15. M. R. RAO, Cluster analysis and mathematical programming, J. Amer. Statist. Assoc., 66 (1971), pp. 622-626.