IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/3935804.html
   My bibliography  Save this article

An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem

Author

Listed:
  • Yongfei Zhang
  • Jun Wu
  • Liming Zhang
  • Peng Zhao
  • Junping Zhou
  • Minghao Yin

Abstract

The connected vertex cover ( ) problem, which has many important applications, is a variant of the vertex cover problem, such as wireless network design, routing, and wavelength assignment problem. A good algorithm for the problem can help us improve engineering efficiency, cost savings, and resources consumption in industrial applications. In this work, we present an efficient algorithm GRASP-CVC (Greedy Randomized Adaptive Search Procedure for Connected Vertex Cover) for in general graphs. The algorithm has two main phases, i.e., construction phase and local search phase. In the construction phase, to construct a high quality feasible initial solution, we design a greedy function and a restricted candidate list. In the local search phase, the configuration checking strategy is adopted to decrease the cycling problem. The experimental results demonstrate that GRASP-CVC is better than other comparison algorithms in terms of effectivity and efficiency.

Suggested Citation

  • Yongfei Zhang & Jun Wu & Liming Zhang & Peng Zhao & Junping Zhou & Minghao Yin, 2018. "An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem," Mathematical Problems in Engineering, Hindawi, vol. 2018, pages 1-10, September.
    • Handle: RePEc:hin:jnlmpe:3935804
    DOI: 10.1155/2018/3935804
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2018/3935804.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2018/3935804.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2018/3935804?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
    ---><---

    Citations

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


    Cited by:

    1. Pablo Moscato & Luke Mathieson & Mohammad Nazmul Haque, 2021. "Augmented intuition: a bridge between theory and practice," Journal of Heuristics, Springer, vol. 27(4), pages 497-547, August.

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:3935804. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.