Papers › Algorithms for the Euclidean Bipartite Edge Cover Problem
Algorithms for the Euclidean Bipartite Edge Cover Problem
Rodrigo A. Castro, José M. Díaz-Báñez, Marco A. Heredia, Jorge Urrutia, Inmaculada Ventura, Francisco J. Zaragoza
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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 bipartite, this problem can be solved in time O(|V|³) via a well-known reduction to a maximum-cost matching problem on G. If in addition V is a set of points on the Euclidean line, Collanino et al. showed that the problem can be solved in time O(|V| log|V|) and asked whether it can be solved in time o(|V|³) if V is a set of points on the Euclidean plane. We answer this in the affirmative, giving an O(|V|^(2.5) log|V|) algorithm based on the Hungarian method using weighted Voronoi diagrams. We also propose some 2-approximation algorithms and give experimental results of our implementations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections