A 4/3-approximation for Minimum Weight Edge Cover
Abstract
This paper addresses the minimum weight edge cover problem (MEC), which is stated as follows: Given a graph G = (V, E), find a set of edges S : S ⊆ E and P e∈S w(e) 6 P e∈Q w(e) ∀Q : Q is an edge cover. Where an edge cover P is a set of edges such that ∀v ∈ V v is incident to at least one edge in P. An efficient implementation of a 4/3- approximation for MEC is provided. Empirical results obtained experimentally from practical data sets are reported and compared against various other approximation algorithms for MEC.
Degree
M.Sc.
Advisors
Pothen, Purdue University.
Subject Area
Mathematics
Off-Campus Purdue Users:
To access this dissertation, please log in to our
proxy server.