IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v47y2024i5d10.1007_s10878-024-01186-y.html
   My bibliography  Save this article

Improved kernelization and fixed-parameter algorithms for bicluster editing

Author

Listed:
  • Manuel Lafond

    (Université de Sherbrooke)

Abstract

Given a bipartite graph G, the Bicluster Editing problem asks for the minimum number of edges to insert or delete in G so that every connected component is a bicluster, i.e. a complete bipartite graph. This has several applications, including in bioinformatics and social network analysis. In this work, we study the parameterized complexity under the natural parameter k, which is the number of allowed modified edges. We first show that one can obtain a kernel with 4.5k vertices, an improvement over the previously known quadratic kernel. We then propose an algorithm that runs in time $$O^*(2.581^k)$$ O ∗ ( 2 . 581 k ) . Our algorithm has the advantage of being conceptually simple and should be easy to implement.

Suggested Citation

  • Manuel Lafond, 2024. "Improved kernelization and fixed-parameter algorithms for bicluster editing," Journal of Combinatorial Optimization, Springer, vol. 47(5), pages 1-27, July.
    • Handle: RePEc:spr:jcomop:v:47:y:2024:i:5:d:10.1007_s10878-024-01186-y
    DOI: 10.1007/s10878-024-01186-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-024-01186-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-024-01186-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Anke van Zuylen & David P. Williamson, 2009. "Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems," Mathematics of Operations Research, INFORMS, vol. 34(3), pages 594-620, August.
    2. Gilberto F. Sousa Filho & Teobaldo L. Bulhões Júnior & Lucidio A. F. Cabral & Luiz Satoru Ochi & Fábio Protti, 2017. "New heuristics for the Bicluster Editing Problem," Annals of Operations Research, Springer, vol. 258(2), pages 781-814, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Andrea Aveni & Ludovico Crippa & Giulio Principi, 2024. "On the Weighted Top-Difference Distance: Axioms, Aggregation, and Approximation," Papers 2403.15198, arXiv.org, revised Mar 2024.
    2. Athanassoglou, Stergios, 2013. "Multidimensional welfare rankings," MPRA Paper 51642, University Library of Munich, Germany.
    3. Sai Ji & Dachuan Xu & Min Li & Yishui Wang, 2022. "Approximation algorithms for two variants of correlation clustering problem," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 933-952, July.
    4. Stergios Athanassoglou, 2015. "Multidimensional welfare rankings under weight imprecision: a social choice perspective," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 44(4), pages 719-744, April.
    5. Sai Ji & Dachuan Xu & Min Li & Yishui Wang, 0. "Approximation algorithms for two variants of correlation clustering problem," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-20.
    6. Stergios Athanassoglou, 2013. "Robust Multidimensional Welfare Comparisons: One Vector of Weights, One Vote," Working Papers 2013.40, Fondazione Eni Enrico Mattei.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:47:y:2024:i:5:d:10.1007_s10878-024-01186-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.