Efficient algorithms for cluster editing

DOI10.1007/S10878-014-9756-7MaRDI QIDQ5963626zbMATH OpenOpenAlexFDO

Authors Lucas Bastos, Luiz S. Ochi, Fábio Protti, A. Subramanian, Ivan C. Martins, Rian G. S. Pinheiro

Publication date 23 February 2016

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-014-9756-7

zbMATH Keywords

combinatorial optimizationmetaheuristicsdata reductionhybrid algorithmscluster editingexact methods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Exact algorithms for cluster editing: Evaluation and experiments
• Cluster editing
• Exact Algorithms for Cluster Editing: Evaluation and Experiments
• The Multi-parameterized Cluster Editing Problem
• Going Weighted: Parameterized Algorithms for Cluster Editing

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 2050708 (Why is no real title available?)
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• A cutting plane algorithm for a clustering problem
• A more effective linear kernelization for cluster editing
• Applying modular decomposition to parameterized cluster editing problems
• Cluster graph modification problems
• Clustering with qualitative information
• Diameters of Random Graphs
• Exact Algorithms for Cluster Editing: Evaluation and Experiments
• Going Weighted: Parameterized Algorithms for Cluster Editing
• Graph-modeled data clustering: Exact algorithms for clique generation
• Random Graphs
• The Cluster Editing Problem: Implementations and Experiments
• Variable Neighborhood Search

Cited in

(20)

• Exact Algorithms for Cluster Editing: Evaluation and Experiments
• Exact algorithms for cluster editing: Evaluation and experiments
• Parameterized Dynamic Cluster Editing
• A matheuristic for the cell formation problem
• Branch-and-price for \(p\)-cluster editing
• Fast quasi-threshold editing
• A hybrid iterated local search heuristic for the maximum weight independent set problem
• Conference scheduling: a clustering-based approach
• Polyhedral properties of the induced cluster subgraphs
• An exact and heuristic approach for the d-minimum branch vertices problem
• Cluster editing
• The maximum independent union of cliques problem: complexity and exact approaches
• A parallel hybrid metaheuristic for bicluster editing
• Cluster editing with vertex splitting
• Declawing a graph: polyhedra and branch-and-cut algorithms
• A heuristic algorithm for the cluster editing problem
• A faster algorithm for the cluster editing problem on proper interval graphs
• Branch-and-cut approaches for p-cluster editing
• Efficient algorithms for the block edit problems
• Cluster editing problem for points on the real line: a polynomial time algorithm

This page was built for publication: Efficient algorithms for cluster editing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963626)