Abstract

For weighted directed chain-cycle graphs, an algorithm transforming one graph into another is constructed. The algorithm runs in linear time and yields a sequence of transformations with the smallest, up to an additive error, total cost. The costs of the operations of inserting and deleting an edge segment may differ from each other and from the costs of the other operations. The additive error is estimated in terms of the operation costs.

中文翻译：

---

优化运营成本总和的链环图变换的几乎精确线性算法

摘要

对于加权有向链环图，构造了一种将一个图转换为另一个图的算法。该算法以线性时间运行，并产生一系列转换序列，这些转换序列的总成本最小，最大误差为累加误差。插入和删除边缘段的操作成本可能彼此不同，也可能与其他操作的成本不同。附加误差是根据运营成本估算的。