IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v31y2016i1d10.1007_s10878-014-9756-7.html
   My bibliography  Save this article

Efficient algorithms for cluster editing

Author

Listed:
  • Lucas Bastos

    (Praia do Flamengo 200 - 1ºandar)

  • Luiz Satoru Ochi

    (Instituto de Computação)

  • Fábio Protti

    (Instituto de Computação)

  • Anand Subramanian

    (Departamento de Engenharia de Produção)

  • Ivan César Martins

    (Instituto de Computação)

  • Rian Gabriel S. Pinheiro

    (Instituto de Computação)

Abstract

The cluster editing problem consists of transforming an input graph $$G$$ G into a cluster graph (a disjoint union of complete graphs) by performing a minimum number of edge editing operations. Each edge editing operation consists of either adding a new edge or removing an existing edge. In this paper we propose new theoretical results on data reduction and instance generation for the cluster editing problem, as well as two algorithms based on coupling an exact method to, respectively, a GRASP or ILS heuristic. Experimental results show that the proposed algorithms are able to find high-quality solutions in practical runtime.

Suggested Citation

  • Lucas Bastos & Luiz Satoru Ochi & Fábio Protti & Anand Subramanian & Ivan César Martins & Rian Gabriel S. Pinheiro, 2016. "Efficient algorithms for cluster editing," Journal of Combinatorial Optimization, Springer, vol. 31(1), pages 347-371, January.
    • Handle: RePEc:spr:jcomop:v:31:y:2016:i:1:d:10.1007_s10878-014-9756-7
    DOI: 10.1007/s10878-014-9756-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-014-9756-7
    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-014-9756-7?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. Deborah E. Lange, 2010. "Data and Methods," Palgrave Macmillan Books, in: Power and Influence, chapter 0, pages 175-188, Palgrave Macmillan.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zeynep Ertem & Eugene Lykhovyd & Yiming Wang & Sergiy Butenko, 2020. "The maximum independent union of cliques problem: complexity and exact approaches," Journal of Global Optimization, Springer, vol. 76(3), pages 545-562, March.
    2. Teobaldo Bulhões & Anand Subramanian & Gilberto F. Sousa Filho & Lucídio dos Anjos F. Cabral, 2017. "Branch-and-price for p-cluster editing," Computational Optimization and Applications, Springer, vol. 67(2), pages 293-316, June.
    3. Bulhões, Teobaldo & Correia, Rubens & Subramanian, Anand, 2022. "Conference scheduling: A clustering-based approach," European Journal of Operational Research, Elsevier, vol. 297(1), pages 15-26.
    4. Thays A. Oliveira & Yuri B. Gabrich & Helena Ramalhinho & Miquel Oliver & Miri W. Cohen & Luiz S. Ochi & Serigne Gueye & Fábio Protti & Alysson A. Pinto & Diógenes V. M. Ferreira & Igor M. Coelho & Vi, 2020. "Mobility, Citizens, Innovation and Technology in Digital and Smart Cities," Future Internet, MDPI, vol. 12(2), pages 1-27, January.
    5. Felipe C. Fragoso & Gilberto F. Sousa Filho & Fábio Protti, 2021. "Declawing a graph: polyhedra and Branch-and-Cut algorithms," Journal of Combinatorial Optimization, Springer, vol. 42(1), pages 85-124, July.

    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. Arnold Pabian & Barbara Pabian, 2023. "Role of Social Media in Managing Knowledge of the Young Generation in the Sustainability Area," Sustainability, MDPI, vol. 15(7), pages 1-16, March.

    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:31:y:2016:i:1:d:10.1007_s10878-014-9756-7. 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.