IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Special Section on Circuit, System, and Computer Technologies
Computing-Based Performance Analysis of Approximation Algorithms for the Minimum Weight Vertex Cover Problem of Graphs
Satoshi TAOKADaisuke TAKAFUJIToshimasa WATANABE
Author information
JOURNALS RESTRICTED ACCESS

Volume E96.A (2013) Issue 6 Pages 1331-1339

Details
Download PDF (1622K) Contact us
Abstract

A vertex cover of a given graph G=(V,E) is a subset N of V such that N contains either u or v for any edge (u,v) of E. The minimum weight vertex cover problem (MWVC for short) is the problem of finding a vertex cover N of any given graph G=(V,E), with weight w(v) for each vertex v of V, such that the sum w(N) of w(v) over all v of N is minimum. In this paper, we consider MWVC with w(v) of any v of V being a positive integer. We propose simple procedures as postprocessing of algorithms for MWVC. Furthremore, five existing approximation algorithms with/without the proposed procedures incorporated are implemented, and they are evaluated through computing experiment.

Information related to the author
© 2013 The Institute of Electronics, Information and Communication Engineers
Previous article Next article

Recently visited articles
Journal news & Announcements
  • Please contact trans-a[a]ieice.org, if you want to unlock PDF security.
feedback
Top