Abstract
Given a graph G = (S,E), the problem dealt with in this paper consists in partitioning S into a disjoint union of cliques by adding or removing a minimum number z(G) of edges. The problem, which is refered to by the Zahn Problem (ZP), is NP-hard in general.
This paper presents a constraint programming approach to ZP. The problem is formulated in terms of a Weighted Constraint Satisfaction Problem (WCSP), a widely used framework for solving hard combinatorial problems. As a seach strategy, we applied a Limited Discrepancy Search coupled with a branch-and-bound algorithm, a combination which has proved to be very advantageous.
We compared our approach to a fixed-parameter tractability algorithm, one of the most used algorithms for solving ZP. The comparison clearly show that our approach is very competitive, especially on large ZP instances.
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
Zahn, C.T.: Approximating symmetric relations. SIAM J. Appel. Math. 12, 840–847 (1964)
Sebastian, B.: Weighted cluster editing for clustering biological data, Jena (2007)
Pipenbacher, P., Schliep, A., Schneckener, S., Schonhuth, A., Schomburg, D., Schrader, R.: ProClust: Improved clustering of protein sequences with an extended graph-based approach. Bioinformatics (2002)
Larrosa, J., Schiex, T.: Solving Weighted CSP by Maintaining Arc-consistency. Artificial Intelligence (2004)
Hansen, P., Jaumard, B.: Cluster analysis and mathematical programming. Math Programming (1998)
Krivarek, M., Moravek, J.: NP-hard Problem in hierarchical-tree Clustering. Acta Inform. (1986)
Charon, I., Hudry, O.: Noising methods for a clique partitioning problem. Discrete Applied Mathematics 154 (2006)
Schiex, T., Fargier, H., Verfaillie, G.: Valued constraint satisfaction problems: Hard and easy problems. In: IJCAI (1995)
Sanchez, M., De Givry, S., Schiex, T.: Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques. Constraints (2008)
Harvey William, D., Ginsberg Matthew, L.: Limited discrepancy search. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (1995)
Karoui, W., Huguet, M.-J., Lopez, P., Naanaa, W.: YIELDS: A Yet Improved Limited Discrepancy Search for CSPs. In: Van Hentenryck, P., Wolsey, L. (eds.) CPAIOR 2007. LNCS, vol. 4510, pp. 99–111. Springer, Heidelberg (2007)
Dehne, F., 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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Amel, M., Wady, N. (2014). A Constraint Programming Approach to the Zahn’s Decision Problem. In: Omatu, S., Bersini, H., Corchado, J., Rodríguez, S., Pawlewski, P., Bucciarelli, E. (eds) Distributed Computing and Artificial Intelligence, 11th International Conference. Advances in Intelligent Systems and Computing, vol 290. Springer, Cham. https://doi.org/10.1007/978-3-319-07593-8_59
Download citation
DOI: https://doi.org/10.1007/978-3-319-07593-8_59
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07592-1
Online ISBN: 978-3-319-07593-8
eBook Packages: EngineeringEngineering (R0)