Abstract
In this paper, we study the cluster editing problem which is fixed parameter tractable. We present the first practical implementation of a FPT based method for cluster editing, using the approach in [6,7], and compare our implementation with the straightforward greedy method and a solution based on linear programming [3]. Our experiments show that the best results are obtained by using the refined branching method in [7] together with interleaving (re-kernelization). We also observe an interesting lack of monotonicity in the running times for “yes” instances with increasing values of k.
This research has been supported in part by the Natural Sciences and Engineering Research Council of Canada and by the U.S. National Institutes of Health under grants 1-R01-MH-074460-01, 1-P01-DA-015027-01 and U01-AA13512.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: Theory and experiments. In: Proceedings, Workshop on Algorithm Engineering and Experiments, New Orleans, Louisiana (2004)
Abu-Khzam, F.N., Langston, M.A., Shanbhag, P., Symons, C.T.: Scalable parallel algorithms for FPT problems. Algorithmica (2006) (accepted for publication)
Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. Journal of Computer and System Sciences 71, 360–383 (2005)
Damaschke, P.: On the fixed-parameter enumerability of cluster editing. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 283–294. Springer, Heidelberg (2005)
Damaschke, P.: Fixed-parameter tractable generalizations of cluster editing. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 344–355. Springer, Heidelberg (2006)
Gramm, J., Guo, J., Hueffner, F., Niedermeier, R.: Graph-modeled data clustering: Fixed-parameter algorithms for clique generation. Theory of Computing Systems 38(4), 373–392 (2005)
Guo, J.: Algorithm design techniques for parameterized graph modification problems. PhD thesis, Univ. Jena (2005)
Hemaspaandra, E., Rothe, J., Spakowski, H.: Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP. In: Kučera, L. (ed.) WG 2002. LNCS, vol. 2573, pp. 258–269. Springer, Heidelberg (2002)
Knuth, D.E.: The Art of Computer Programming, Seminumerical algorithms, 3rd edn., vol. 2. Addison-Wesley, Reading (1997)
Zhang, Y., Abu-Khzam, F.N., Baldwin, N.E., Chesler, E.J., Langston, M.A., Samatova, N.F.: Genome-scale computational approaches to memory-intensive applications in systems biology. In: Proceedings, Supercomputing, Seattle, Washington (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dehne, F., Langston, M.A., Luo, X., Pitre, S., Shaw, P., Zhang, Y. (2006). The Cluster Editing Problem: Implementations and Experiments. In: Bodlaender, H.L., Langston, M.A. (eds) Parameterized and Exact Computation. IWPEC 2006. Lecture Notes in Computer Science, vol 4169. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11847250_2
Download citation
DOI: https://doi.org/10.1007/11847250_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39098-5
Online ISBN: 978-3-540-39101-2
eBook Packages: Computer ScienceComputer Science (R0)