New heuristics for the bicluster editing problem

DOI10.1007/S10479-016-2261-XzbMATH Open1377.90105OpenAlexW2460696639MaRDI QIDQ1686528FDOQ1686528

Luiz S. Ochi, Lucidio A. F. Cabral, Fábio Protti, Teobaldo L. Bulhões Júnior, Gilberto F. de Sousa Filho

Publication date: 15 December 2017

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-016-2261-x

Recommendations

• Hybrid metaheuristic for bicluster editing problem
• A parallel hybrid metaheuristic for bicluster editing
• Improved Algorithms for Bicluster Editing
• The biclique partitioning polytope
• Faster parameterized algorithm for Bicluster Editing

zbMATH Keywords

metaheuristicclustering problembicluster editing problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Random Graphs
• Title not available (Why is that?)
• Applying modular decomposition to parameterized cluster editing problems
• Correlation clustering
• Variable neighbourhood search: methods and applications
• Improved Algorithms for Bicluster Editing
• Cluster graph modification problems
• Improved Approximation Algorithms for Bipartite Correlation Clustering
• Title not available (Why is that?)

Cited In (5)

• Improved Algorithms for Bicluster Editing
• Even better fixed-parameter algorithms for bicluster editing
• Faster parameterized algorithm for \textsc{Bicluster Editing}
• Complexity of modification problems for reciprocal best match graphs
• Improved kernelization and fixed-parameter algorithms for bicluster editing

Uses Software

• FABIA

This page was built for publication: New heuristics for the bicluster editing problem

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