IWPEC 2006: Parameterized and Exact Computation pp 13-24 | Cite as
The Cluster Editing Problem: Implementations and Experiments
Conference paper
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.
Keywords
Binary Search Vertex Cover Edit Distance Common Neighbor Greedy Method
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.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)Google Scholar
- 2.Abu-Khzam, F.N., Langston, M.A., Shanbhag, P., Symons, C.T.: Scalable parallel algorithms for FPT problems. Algorithmica (2006) (accepted for publication)Google Scholar
- 3.Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. Journal of Computer and System Sciences 71, 360–383 (2005)MATHCrossRefMathSciNetGoogle Scholar
- 4.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)CrossRefGoogle Scholar
- 5.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)CrossRefGoogle Scholar
- 6.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)MATHCrossRefMathSciNetGoogle Scholar
- 7.Guo, J.: Algorithm design techniques for parameterized graph modification problems. PhD thesis, Univ. Jena (2005)Google Scholar
- 8.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)CrossRefGoogle Scholar
- 9.Knuth, D.E.: The Art of Computer Programming, Seminumerical algorithms, 3rd edn., vol. 2. Addison-Wesley, Reading (1997)Google Scholar
- 10.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)Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2006