Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints

@inproceedings{Chan2014RankingOA,
  title={Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints},
  author={T.-H. Hubert Chan and Fei Chen and Xiaowei Wu and Zhichao Zhao},
  booktitle={SODA},
  year={2014}
}
Motivated by online advertisement and exchange settings, greedy randomized algorithms for the maximum matching problem have been studied, in which the algorithm makes (random) decisions that are essentially oblivious to the input graph. Any greedy algorithm can achieve performance ratio 0.5, which is the expected number of matched nodes to the number of nodes in a maximum matching. Since Aronson, Dyer, Frieze and Suen proved that the Modified Randomized Greedy (MRG) algorithm achieves… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…