Alternative parameterizations for cluster editing

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

Volumn 6543 LNCS, Issue , 2011, Pages 344-355

  Komusiewicz, Christian ^a   Uhlmann, Johannes ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMICS; COMBINED PARAMETER; EDGE MODIFICATION; MAXIMUM DEGREE; NONNEGATIVE INTEGERS; NP-HARD; NUMBER OF CLUSTERS; PARAMETERIZATIONS; PARAMETERIZED; REAL-WORLD; UNDIRECTED GRAPH;

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; PARAMETERIZATION;

GRAPH THEORY;

EID: 78751666360     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-18381-2_29     Document Type: Conference Paper

References (17)

1. Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Machine Learning 56(1-3), 89-113 (2004)
2. Böcker, S., Briesemeister, S., Bui, Q.B.A., Truß, A.: Going weighted: Parameterized algorithms for cluster editing. Theor. Comput. Sci. 410(52), 5467-5480 (2009)
3. Böcker, S., Briesemeister, S., Klau, G.W.: Exact algorithms for cluster editing: Evaluation and experiments. Algorithmica (2009) (to appear)
4. Chen, J., Meng, J.: A 2k kernel for the cluster editing problem. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol. 6196, pp. 459-468. Springer, Heidelberg (2010)
5. Damaschke, P.: Fixed-parameter enumerability of cluster editing and related problems. Theory Comput. Syst. 46(2), 261-283 (2010)
6. Dehne, F.K.H.A., Langston, M.A., Luo, X., Pitre, S., Shaw, P., Zhang, Y.: The cluster editing problem: Implementations and experiments. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 13-24. Springer, Heidelberg (2006)
7. Demaine, E.D., Hajiaghayi, M., Marx, D.: Open problems - parameterized complexity and approximation algorithms. In: Parameterized Complexity and Approximation Algorithms. Dagstuhl Seminar Proceedings, vol. 09511. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2010)
8. Fellows, M.R., Guo, J., Komusiewicz, C., Niedermeier, R., Uhlmann, J.: Graphbased data clustering with overlaps. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol. 5609, pp. 516-526. Springer, Heidelberg (2009)
9. Fellows, M.R., Langston, M.A., Rosamond, F.A., Shaw, P.: Efficient parameterized preprocessing for Cluster Editing. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) FCT 2007. LNCS, vol. 4639, pp. 312-321. Springer, Heidelberg (2007)
10. Gramm, J., Guo, J., Hüffner, F., Niedermeier, R.: Graph-modeled data clustering: Exact algorithms for clique generation. Theory Comput. Syst. 38(4), 373-392 (2005)
11. Guo, J.: A more effective linear kernelization for cluster editing. Theor. Comput. Sci. 410(8-10), 718-726 (2009)
12. Guo, J., Komusiewicz, C., Niedermeier, R., Uhlmann, J.: A more relaxed model for graph-based data clustering: s-plex cluster editing. SIAM Journal on Discrete Mathematics (2010) (to appear)
13. Hüffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. Theory Comput. Syst. 47(1), 196-217 (2010)
14. Křivánek, M., Morávek, J.: NP-hard problems in hierarchical-tree clustering. Acta Inform. 23(3), 311-323 (1986)
15. Niedermeier, R.: Reflections on multivariate algorithmics and problem parameterization. In: Proc. 27th STACS, vol. 5, pp. 17-32. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, LIPIcs (2010)
16. Protti, F., da Silva, M.D., Szwarcfiter, J.L.: Applying modular decomposition to parameterized cluster editing problems. Theory Comput. Syst. 44(1), 91-104 (2009)
17. Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Appl. Math. 144(1-2), 173-182 (2004)