Derandomization of Online Assignment Algorithms for Dynamic Graphs
Computational Complexity
2011-05-03 v1 Distributed, Parallel, and Cluster Computing
Data Structures and Algorithms
Abstract
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.
Cite
@article{arxiv.1105.0233,
title = {Derandomization of Online Assignment Algorithms for Dynamic Graphs},
author = {Ankur Sahai},
journal= {arXiv preprint arXiv:1105.0233},
year = {2011}
}