Loading [a11y]/accessibility-menu.js
A fast heuristic for the minimum weight vertex cover problem | IEEE Conference Publication | IEEE Xplore

A fast heuristic for the minimum weight vertex cover problem


Abstract:

Given a vertex-weighted undirected graph, to find the vertex cover of minimum weight is called minimum weight vertex cover problem (MWVCP). It is known as an NP-hard prob...Show More

Abstract:

Given a vertex-weighted undirected graph, to find the vertex cover of minimum weight is called minimum weight vertex cover problem (MWVCP). It is known as an NP-hard problem. In this paper, a fast heuristic for MWVCP is proposed. Our algorithm is based on a simple algorithm called “list-heuristic.” Experimenal results show that our algorithm calculates better solutions in shorter time than approximation algorithms for MWVCP.
Date of Conference: 26-29 June 2016
Date Added to IEEE Xplore: 25 August 2016
ISBN Information:
Conference Location: Okayama, Japan

References

References is not available for this document.