2 citations · 5 across the 6 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.CC2011
Derandomization of Online Assignment Algorithms for Dynamic Graphs
Ankur Sahai
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…
cs.DC2011★ 1 cited
Online Assignment Algorithms for Dynamic Bipartite Graphs
Ankur Sahai
This paper analyzes the problem of assigning weights to edges incrementally in a dynamic complete bipartite graph consisting of producer and consumer nodes. The objective is to min…