Algorithms for the Euclidean Bipartite Edge Cover Problem

Rodrigo A. Castro, José M. Díaz-Báñez, Marco A. Heredia +3

Given a graph $G=(V,E)$ with costs on its edges, the minimum-cost edge cover problem consists of finding a subset of $E$ covering all vertices in $V$ at minimum cost. If $G$ is bip…