Efficient algorithms for cluster editing
From MaRDI portal
Publication:5963626
DOI10.1007/s10878-014-9756-7zbMath1341.90106OpenAlexW2046728583MaRDI QIDQ5963626
Lucas Bastos, Fábio Protti, Luiz Satoru Ochi, Ivan César Martins, Anand Subramanian, Rian Gabriel 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)
Related Items (8)
The maximum independent union of cliques problem: complexity and exact approaches ⋮ A matheuristic for the cell formation problem ⋮ Conference scheduling: a clustering-based approach ⋮ A hybrid iterated local search heuristic for the maximum weight independent set problem ⋮ An exact and heuristic approach for the \(d\)-minimum branch vertices problem ⋮ Branch-and-price for \(p\)-cluster editing ⋮ Polyhedral properties of the induced cluster subgraphs ⋮ Declawing a graph: polyhedra and branch-and-cut algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph-modeled data clustering: Exact algorithms for clique generation
- A more effective linear kernelization for cluster editing
- A cutting plane algorithm for a clustering problem
- Cluster graph modification problems
- Applying modular decomposition to parameterized cluster editing problems
- Clustering with qualitative information
- The Cluster Editing Problem: Implementations and Experiments
- Exact Algorithms for Cluster Editing: Evaluation and Experiments
- Diameters of Random Graphs
- Variable Neighborhood Search
- Going Weighted: Parameterized Algorithms for Cluster Editing
- Random Graphs
This page was built for publication: Efficient algorithms for cluster editing