Efficient algorithms for cluster editing
DOI10.1007/S10878-014-9756-7zbMATH Open1341.90106OpenAlexW2046728583MaRDI QIDQ5963626FDOQ5963626
Lucas Bastos, Fábio Protti, Luiz S. Ochi, Ivan C. Martins, A. Subramanian, 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
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Random Graphs
- Applying modular decomposition to parameterized cluster editing problems
- Clustering with qualitative information
- Variable Neighborhood Search
- A cutting plane algorithm for a clustering problem
- Cluster graph modification problems
- A more effective linear kernelization for cluster editing
- The Cluster Editing Problem: Implementations and Experiments
- Graph-modeled data clustering: Exact algorithms for clique generation
- Going Weighted: Parameterized Algorithms for Cluster Editing
- Exact Algorithms for Cluster Editing: Evaluation and Experiments
- Diameters of Random Graphs
Cited In (11)
- Parameterized Dynamic Cluster Editing
- A matheuristic for the cell formation problem
- Branch-and-price for \(p\)-cluster 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
- The maximum independent union of cliques problem: complexity and exact approaches
- Declawing a graph: polyhedra and branch-and-cut algorithms
- Cluster editing with vertex splitting
- Efficient algorithms for the block edit problems
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)
