使用加权拟阵交算法优化有向生成树
Optimization of the directed spanning trees using the weighted matroid intersection algorithm
浏览论文内容
中文总结 AI 辅助
研究给定样本树权重等变化时更新有向最小生成树的问题，核心方法是用加权拟阵交算法，通过维护动态辅助图实现迭代更新，贡献是给出算法实现及实验分析。
中文摘要 AI 辅助
本文考虑给定样本树权重变化、边删除和边插入时更新有向最小生成树（DMST）的问题。我们提出一种用加权拟阵交算法将树更新为DMST的实现方法。算法着重维护动态辅助图，其在拟阵交算法中起核心作用并控制从给定树到DMST的迭代，每次迭代都能得到改进解。我们还给出算法实现及一些实验分析。
英文摘要
In this paper, we consider the problem of updating the directed minimum spanning tree (DMST), when the given sample tree is subject to the weight changes, edge deletions and edge insertions. We present an implementation for updating the tree to a DMST using the weighted matroid intersection algorithm. Our algorithm focuses on maintaining a dynamic auxiliary graph, which plays a central role in the matroid intersection algorithm, and governs the iterations from the given tree to a DMST. Each iteration is guaranteed to yield an improved solution. We also provide an implementation of this algorithm and some experimental analysis.
