Cluster graph modification problems

Discrete Applied Mathematics

Volumn 144, Issue 1-2, 2004, Pages 173-182

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

^a TEL AVIV UNIVERSITY   (Israel)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

Approximation; Cluster graph; Clustering; Complexity; Graph modification problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

CLUSTER GRAPH; CLUSTERING; COMPLEXITY; GRAPH MODIFICATION;

GRAPH THEORY;

EID: 4544382534     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.01.007     Document Type: Article

References (20)

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) (2000) 503-511.
2. N. Bansal, S. Chawla, A. Blum, Correlation clustering, in: Proceedings of the 43rd Annual Symposium on Foundations of Computer Science (FOCS), 2002, pp. 238-247.
3. A. Ben-Dor, R. Shamir, Z. Yakhini, Clustering gene expression patterns, J. Comput. Biol. 6 (3/4) (1999) 281-297.
4. C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
5. Z.Z. Chen, T. Jiang, G. Lin, Computing phylogenetic roots with bounded degrees and errors, SIAM J. Comput. 32 (2003) 864-879.
6. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Co., San Francisco, 1979.
7. M.X. Goemans, D.P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM 42 (6) (1995) 1115-1145.
8. T.R. Golub, D.K. Slonim et al., Molecular classification of cancer: class discovery and class prediction by gene expression monitoring, Science 286 (1999) 531-537.
9. C. Hagen, A. Kahng, New spectral methods for ratio cut partitioning and clustering, IEEE Trans. Comput. Aided Design of Integrated Circuits Systems 11 (9) (1992) 1074-1085.
10. P. Hansen, B. Jaumard, Oluster analysis and mathematical programming, Math. Programming 79 (1997) 191-215.
11. J. Hartigan, Clustering Algorithms, Wiley, New York, 1975.
12. D.S. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems, PWS Publishing, Boston, 1997.
13. L. Lovasz, Covering and coloring of hypergraphs, in: Proceedings of the Fourth Southeastern Conference on Combinatorics Graph Theory and Computing, Utilitas Mathematica Publishing 1973.
14. A. Natanzon, Complexity and approximation of some Graph modification problems, Master's thesis, Department of Computer Science, Tel Aviv University, 1999.
15. A. Natanzon, R. Shamir, R. Sharan, Complexity classification of some edge modification problems, Discrete Appl. Math. 113 (2001) 109-128.
16. C. Papadimitriou, M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci. 43 (1991) 425-440.
17. R. Shamir, R. Sharan, D. Tsur, Cluster graph modification problems, in: Porceedings of the 27th International Workshop Graph-Theoretic Concepts in Computer Science (WG), 2002, pp. 379-390.
18. R. Sharan, A. Maron-Katz, R. Shamir, CLICK and EXPANDER: a system for clustering and visualizing gene expression data, Bioinformatics 19 (2003) 1787-1799 (A preliminary version appeared in Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology (ISMB), pp. 307-316, AAAI Press, New York, 2000).
19. R. Sharan, A. Maron-Katz, R. Shamir, CLICK and EXPANDER: a system for clustering and visualizing gene expression data, Bioinformatics 19 (2003) 1787-1799 (A preliminary version appeared in Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology (ISMB), pp. 307-316, AAAI Press, New York, 2000).
20. Z. Wu, R. Leahy, An optimal graph theoretic approach to data clustering: theory and its application to image segmentation, IEEE Trans. Pattern Analysis Mach. Intell. 15 (11) (1993) 1101-1113.