%0 Thesis %A Gallagher, Steven Alec %D 2020 %T A 4/3-approximation for Minimum Weight Edge Cover %U https://hammer.purdue.edu/articles/thesis/A_4_3-approximation_for_Minimum_Weight_Edge_Cover/12126774 %R 10.25394/PGS.12126774.v1 %2 https://hammer.purdue.edu/ndownloader/files/22300512 %K MEM %K edge %K cover %K MWM %K matching %K approximation %K Applied Computer Science %X 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 ∑e∈Sw(e) e∈Qw(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.
%I Purdue University Graduate School