欧氏二分边覆盖问题的算法
Algorithms for the Euclidean Bipartite Edge Cover Problem
摘要:
给定一个图$G=(V,E)$,其边上有代价,最小代价边覆盖问题包括找到一个以最小代价覆盖$V$中所有顶点的$E$子集。如果$G$是二分的,这个问题可以通过一个众所周知的减少到$G$上的最大成本匹配问题的时间$O(|V|^3)$解决。如果此外$V$是一组点上的欧几里德线,Collanino等人表明,这个问题可以解决的时间$O(|V| \log |V|)$,并询问是否可以解决的时间$o(|V|^3)$,如果$V$是一组点上的欧几里德平面。我们回答这一点是肯定的,给出了一个$O(|V|^{2.5} \log |V|)$算法的基础上匈牙利的方法,使用加权沃罗诺伊图。我们还提出了一些2-近似算法,并给出了我们的实现实验结果。
英文摘要:
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|^3)$ 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|^3)$ 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。