@inproceedings{0d68bac219e446da80b8cef6686b5bbc,
title = "The cluster editing problem: Implementations and experiments",
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 = "Linear programming, Problem solving, Cluster editing, Monotonicity, Artificial intelligence",
author = "F Dehne and M.A. Langston and X. Luo and S. Pitre and P. Shaw and Y Zhang",
year = "2006",
doi = "10.1007/11847250_2",
language = "Undefined",
isbn = "978-3-540-39098-5",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "13--24",
editor = "Bodlaender, {Hans L.} and Langston, {Michael A.}",
booktitle = "IWPEC",
address = "Switzerland",
}