Cluster graph modification problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2573 LNCS, Issue , 2002, Pages 379-390

  Shamir, Ron ^a   Sharan, Roded ^a   Tsur, Dekel ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; CLUSTERING ALGORITHMS; POLYNOMIAL APPROXIMATION; GRAPH THEORY;

CLUSTER EDITING; CLUSTERING PROBLEMS; CONSTANT FACTORS; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; GRAPH MODIFICATION PROBLEMS; GRAPH-THEORETIC; NUMBER OF CLUSTERS; VERTEX DISJOINT;

GRAPH THEORY; POLYNOMIALS;

EID: 84901476329     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36379-3_33     Document Type: Conference Paper

References (16)

1. A. A. Alizadeh, M. B. Eisen, et al. Distinct types of diffuse large B-cell lymphoma identified by gene expression profiling. Nature, 403(6769): 503-511, 2000.
2. A. Ben-Dor, R. Shamir, and Z. Yakhini. Clustering gene expression patterns. Journal of Computational Biology, 6(3/4): 281-297, 1999.
3. C. Berge. Graphs and Hypergraphs. North-Holland, Amsterdam, 1973.
4. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco, 1979.
5. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42(6): 1115-1145, 1995.
6. T. R. Golub, D. K. Slonim, et al. Molecular classification of cancer: Class discovery and class prediction by gene expression monitoring. Science, 286: 531-537, October 1999.
7. C. Hagen and A.B. Kahng. New spectral methods for ratio cut partitioning and clustering. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 11(9): 1074-1085, 1992.
8. P. Hansen and B. Jaumard. Cluster analysis and mathematical programming. Mathematical Programming, 79: 191-215, 1997.
9. J.A. Hartigan. Clustering Algorithms. John Wiley and Sons, 1975.
10. D. S. Hochbaum, editor. Approximation Alogrithms for NP-Hard Problems. PWS Publishing, Boston, 1997.
11. L. Lovasz. Covering and coloring of hypergraphs. In Proc. 4th Southeastern Conf. on Combinatorics, Graph Theory, and Computing. Utilitas Mathematica Publishing, 1973.
12. A. Natanzon. Complexity and approximation of some graph modification problems. Master's thesis, Department of Computer Science, Tel Aviv University, 1999.
13. A. Natanzon, R. Shamir, and R. Sharan. Complexity classification of some edge modification problems. Discrete Applied Mathematics, 113: 109-128, 2001.
14. C. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. J. of Computer and System Science, 43: 425-440, 1991.
15. R. Sharan and R. Shamir. CLICK: A clustering algorithm with applications to gene expression analysis. In Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology (ISMB), pages 307-316, 2000.
16. Z. Wu and R. Leahy. An optimal graph theoretic approach to data clustering: theory and its application to image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 15(11): 1101-1113, 1993.