Skip to main content
SpringerLink
Log in

Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem

  • Conference paper
  • First Online:
Analysis of Experimental Algorithms (SEA 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11544))

Included in the following conference series:

Abstract

Fixed set search (FSS) is a novel metaheuristic adding a learning mechanism to enhanced greedy approaches. In this paper we use FSS for solving the Minimum Weighted Vertex Cover Problem (MWVCP). First we define a Greedy Randomized Adaptive Search Procedure (GRASP) by randomizing the standard greedy constructive algorithm and combine it with a local search. The used local search is based on a simple downhill procedure. It checks if substituting a single or a pair of elements from a solution with ones that need to be added to keep the solution a vertex cover decreases the value of the objective function. The performance of the GRASP algorithm is improved by extending it towards FSS. Computational experiments performed on standard test instances from literature show that the proposed FSS algorithm for the MWVCP is highly competitive with state-of-the-art methods. Further, it is shown that the FSS manages to significantly improve the GRASP algorithm it is based on.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bouamama, S., Blum, C., Boukerram, A.: A population-based iterated greedy algorithm for the minimum weight vertex cover problem. Appl. Soft Comput. 12(6), 1632–1639 (2012)

    Article  Google Scholar 

  2. Cai, S., Li, Y., Hou, W., Wang, H.: Towards faster local search for minimum weight vertex cover on massive graphs. Inf. Sci. 471, 64–79 (2019)

    Article  MathSciNet  Google Scholar 

  3. Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40–42), 3736–3756 (2010)

    Article  MathSciNet  Google Scholar 

  4. Cygan, M., Kowalik, Ł., Wykurz, M.: Exponential-time approximation of weighted set cover. Inf. Process. Lett. 109(16), 957–961 (2009)

    Article  MathSciNet  Google Scholar 

  5. Feo, T.A., Resende, M.G.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6(2), 109–133 (1995). https://doi.org/10.1007/BF01096763

    Article  MathSciNet  MATH  Google Scholar 

  6. Hansen, P., Mladenović, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449–467 (2001)

    Article  MathSciNet  Google Scholar 

  7. Jovanovic, R., Tuba, M.: An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem. Appl. Soft Comput. 11(8), 5360–5366 (2011)

    Article  Google Scholar 

  8. Jovanovic, R., Tuba, M., Voß, S.: Fixed set search applied to the traveling salesman problem. In: Blesa Aguilera, M.J., Blum, C., Gambini Santos, H., Pinacho-Davidson, P., Godoy del Campo, J. (eds.) HM 2019. LNCS, vol. 11299, pp. 63–77. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-05983-5_5

    Chapter  Google Scholar 

  9. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of computer computations, pp. 85–103. Springer, Boston (1972). https://doi.org/10.1007/978-1-4684-2001-2_9

    Chapter  Google Scholar 

  10. Li, R., Hu, S., Zhang, H., Yin, M.: An efficient local search framework for the minimum weighted vertex cover problem. Inf. Sci. 372, 428–445 (2016)

    Article  Google Scholar 

  11. Pullan, W.: Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers. Discrete Optim. 6(2), 214–219 (2009)

    Article  MathSciNet  Google Scholar 

  12. Shyu, S.J., Yin, P.Y., Lin, B.M.: An ant colony optimization algorithm for the minimum weight vertex cover problem. Ann. Oper. Res. 131(1–4), 283–304 (2004). https://doi.org/10.1023/B:ANOR.0000039523.95673.33

    Article  MathSciNet  MATH  Google Scholar 

  13. Singh, A., Gupta, A.K.: A hybrid heuristic for the minimum weight vertex cover problem. Asia-Pac. J. Oper. Res. 23(02), 273–285 (2006)

    Article  MathSciNet  Google Scholar 

  14. Voß, S., Fink, A.: A hybridized tabu search approach for the minimum weight vertex cover problem. J. Heuristics 18(6), 869–876 (2012)

    Article  Google Scholar 

  15. Wang, L., Du, W., Zhang, Z., Zhang, X.: A PTAS for minimum weighted connected vertex cover P3 problem in 3-dimensional wireless sensor networks. J. Comb. Optim. 33(1), 106–122 (2017)

    Article  MathSciNet  Google Scholar 

  16. Zhou, T., Lü, Z., Wang, Y., Ding, J., Peng, B.: Multi-start iterated tabu search for the minimum weight vertex cover problem. J. Comb. Optim. 32(2), 368–384 (2016)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Qatar Environment and Energy Research Institute (QEERI), Hamad bin Khalifa University, PO Box 5825, Doha, Qatar

    Raka Jovanovic

  2. Institute of Information Systems, University of Hamburg, Von-Melle-Park 5, 20146, Hamburg, Germany

    Stefan Voß

  3. Escuela de Ingenieria Industrial, Pontificia Universidad Católica de Valparaíso, Valparaíso, Chile

    Stefan Voß

Authors
  1. Raka Jovanovic
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Voß
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stefan Voß .

Editor information

Editors and Affiliations

  1. Wilfrid Laurier University, Waterloo, ON, Canada

    Ilias Kotsireas

  2. University of Florida, Gainesville, FL, USA

    Panos Pardalos

  3. University of Ioannina, Ioannina, Greece

    Konstantinos E. Parsopoulos

  4. Delft University of Technology, Delft, The Netherlands

    Dimitris Souravlias

  5. University of Florida, Gainesville, FL, USA

    Arsenis Tsokas

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Jovanovic, R., Voß, S. (2019). Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem. In: Kotsireas, I., Pardalos, P., Parsopoulos, K., Souravlias, D., Tsokas, A. (eds) Analysis of Experimental Algorithms. SEA 2019. Lecture Notes in Computer Science(), vol 11544. Springer, Cham. https://doi.org/10.1007/978-3-030-34029-2_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-34029-2_31

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-34028-5

  • Online ISBN: 978-3-030-34029-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation