Derandomization of Online Assignment Algorithms for Dynamic Graphs

Details Derandomization of Online Assignment Algorithms for Dynamic Graphs Derandomization of Online Assignment Algorithms for Dynamic Graphs

2011-05-02

arxiv.org/abs/1105.0233v1

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Derandomization of Online Assignment Algorithms for Dynamic Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Derandomization of Online Assignment Algorithms for Dynamic Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Derandomization of Online Assignment Algorithms for Dynamic Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-426498