IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i21p2674-d662009.html
   My bibliography  Save this article

A Restart Local Search for Solving Diversified Top- k Weight Clique Search Problem

Author

Listed:
  • Jun Wu

    (Information Science and Technology, Northeast Normal University, Changchun 130117, China)

  • Minghao Yin

    (Information Science and Technology, Northeast Normal University, Changchun 130117, China)

Abstract

Diversified top- k weight clique (DTKWC) search problem is an important generalization of the diversified top- k clique (DTKC) search problem with practical applications. The diversified top- k weight clique search problem aims to search k maximal cliques that can cover the maximum weight in a vertex weighted graph. In this work, we propose a novel local search algorithm called TOPKWCLQ for the DTKWC search problem which mainly includes two strategies. First, a restart strategy is adopted, which repeated the construction and updating processes of the maximal weight clique set. Second, a scoring heuristic is designed by giving different priorities for maximal weight cliques in candidate set. Meanwhile, a constraint model of the DTKWC search problem is constructed such that the research concerns can be evaluated. Experimental results show that the proposed algorithm TOPKWCLQ outperforms than the comparison algorithm on large-scale real-world graphs.

Suggested Citation

  • Jun Wu & Minghao Yin, 2021. "A Restart Local Search for Solving Diversified Top- k Weight Clique Search Problem," Mathematics, MDPI, vol. 9(21), pages 1-17, October.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:21:p:2674-:d:662009
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/21/2674/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/21/2674/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yi Chu & Boxiao Liu & Shaowei Cai & Chuan Luo & Haihang You, 2020. "An efficient local search algorithm for solving maximum edge weight clique problem in large graphs," Journal of Combinatorial Optimization, Springer, vol. 39(4), pages 933-954, May.
    2. Li, Chu-Min & Liu, Yanli & Jiang, Hua & Manyà, Felip & Li, Yu, 2018. "A new upper bound for the maximum weight clique problem," European Journal of Operational Research, Elsevier, vol. 270(1), pages 66-77.
    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. Juan Li & Yuan-Hua Yang & Qing An & Hong Lei & Qian Deng & Gai-Ge Wang, 2022. "Moth Search: Variants, Hybrids, and Applications," Mathematics, MDPI, vol. 10(21), pages 1-19, November.
    2. San Segundo, Pablo & Coniglio, Stefano & Furini, Fabio & Ljubić, Ivana, 2019. "A new branch-and-bound algorithm for the maximum edge-weighted clique problem," European Journal of Operational Research, Elsevier, vol. 278(1), pages 76-90.
    3. San Segundo, Pablo & Furini, Fabio & León, Rafael, 2022. "A new branch-and-filter exact algorithm for binary constraint satisfaction problems," European Journal of Operational Research, Elsevier, vol. 299(2), pages 448-467.
    4. Coniglio, Stefano & Furini, Fabio & San Segundo, Pablo, 2021. "A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts," European Journal of Operational Research, Elsevier, vol. 289(2), pages 435-455.
    5. San Segundo, Pablo & Furini, Fabio & Álvarez, David & Pardalos, Panos M., 2023. "CliSAT: A new exact algorithm for hard maximum clique problems," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1008-1025.
    6. Furini, Fabio & Ljubić, Ivana & San Segundo, Pablo & Zhao, Yanlu, 2021. "A branch-and-cut algorithm for the Edge Interdiction Clique Problem," European Journal of Operational Research, Elsevier, vol. 294(1), pages 54-69.

    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:gam:jmathe:v:9:y:2021:i:21:p:2674-:d:662009. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.