动态图在线指派算法的去随机化
Derandomization of Online Assignment Algorithms for Dynamic Graphs
摘要：
本文分析了不同的在线算法的问题分配权重的完全连接的二分图，最大限度地减少总成本，同时满足约束。此图中的边可能会随着时间的推移而消失和重新出现。这些算法的性能是使用模拟测量。本文还试图去随机化的随机在线算法为这个问题。
英文摘要：
This paper analyzes different online algorithms for the problem of assigning weights to edges in a fully-connected bipartite graph that minimizes the overall cost while satisfying constraints. Edges in this graph may disappear and reappear over time. Performance of these algorithms is measured using simulations. This paper also attempts to derandomize the randomized online algorithm for this problem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
