A Simplified Analysis of the Good-Bad $3/2$-Approximation Algorithm for Some Minimum-Cost Graph Problems
In this paper, we consider an easy greedy approximation algorithm, the good-bad algorithm, introduced by Cou\"etoux for finding a minimum-cost set of edges such that every connected component has at least $k$ vertices. Cou\"etoux proves that the good-bad algorithm achieves a $3/2$-approximation for this problem. Davis...