• myGriffith
    • Staff portal
    • Contact Us⌄
      • Future student enquiries 1800 677 728
      • Current student enquiries 1800 154 055
      • International enquiries +61 7 3735 6425
      • General enquiries 07 3735 7111
      • Online enquiries
      • Staff phonebook
    View Item 
    •   Home
    • Griffith Research Online
    • Journal articles
    • View Item
    • Home
    • Griffith Research Online
    • Journal articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

  • All of Griffith Research Online
    • Communities & Collections
    • Authors
    • By Issue Date
    • Titles
  • This Collection
    • Authors
    • By Issue Date
    • Titles
  • Statistics

  • Most Popular Items
  • Statistics by Country
  • Most Popular Authors
  • Support

  • Contact us
  • FAQs
  • Admin login

  • Login
  • Local Search with Noisy Strategy for Minimum Vertex Cover in Massive Graphs

    Thumbnail
    View/Open
    MaPUB1477.pdf (319.1Kb)
    File version
    Accepted Manuscript (AM)
    Author(s)
    Ma, Zongjie
    Fan, Yi
    Su, Kaile
    Li, Chengqian
    Sattar, Abdul
    Griffith University Author(s)
    Sattar, Abdul
    Su, Kaile
    Year published
    2016
    Metadata
    Show full item record
    Abstract
    Finding minimum vertex covers (MinVC) for simple undirected graphs is a well-known NP-hard problem. In the literature there have been many heuristics for obtaining good vertex covers. However, most of them focus on solving this problem in relatively small graphs. Recently, a local search solver called FastVC is designed to solve the MinVC problem on real-world massive graphs. Since the traditional best-picking heuristic was believed to be of high complexity, FastVC replaces it with an approximate best-picking strategy. However, since best-picking has been proved to be powerful for a wide range of problems, abandoning it may ...
    View more >
    Finding minimum vertex covers (MinVC) for simple undirected graphs is a well-known NP-hard problem. In the literature there have been many heuristics for obtaining good vertex covers. However, most of them focus on solving this problem in relatively small graphs. Recently, a local search solver called FastVC is designed to solve the MinVC problem on real-world massive graphs. Since the traditional best-picking heuristic was believed to be of high complexity, FastVC replaces it with an approximate best-picking strategy. However, since best-picking has been proved to be powerful for a wide range of problems, abandoning it may be a great sacrifice. In this paper we have developed a local search MinVC solver which utilizes best-picking with noise to remove vertices. Experiments conducted on a broad range of real-world massive graphs show that our proposed method finds better vertex covers than state-of-the-art local search algorithms on many graphs.
    View less >
    Journal Title
    Lecture Notes in Computer Science
    Volume
    9810
    DOI
    https://doi.org/10.1007/978-3-319-42911-3_24
    Copyright Statement
    © 2016 Springer International Publishing AG. This is an electronic version of an article published in Lecture Notes In Computer Science (LNCS), volume 9810, pp 283-294. Lecture Notes In Computer Science (LNCS) is available online at: http://link.springer.com// with the open URL of your article.
    Subject
    Other information and computing sciences not elsewhere classified
    Publication URI
    http://hdl.handle.net/10072/123832
    Collection
    • Journal articles

    Footer

    Disclaimer

    • Privacy policy
    • Copyright matters
    • CRICOS Provider - 00233E
    • TEQSA: PRV12076

    Tagline

    • Gold Coast
    • Logan
    • Brisbane - Queensland, Australia
    First Peoples of Australia
    • Aboriginal
    • Torres Strait Islander