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

@article{Chan2014RankingOA, title={Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints}, author={T.-H. Hubert Chan and F. Chen and X. Wu and Zhichao Zhao}, journal={ArXiv}, year={2014}, volume={abs/1307.2696} }

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 algorithm achieves performance… CONTINUE READING

16 Citations

Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity

- Computer Science, Mathematics
- 2018

5

Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals

- Computer Science, Mathematics
- 2018

22

The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm

- Computer Science, Mathematics
- 2017

17

Near optimal algorithms for online maximum edge-weighted b-matching and two-sided vertex-weighted b-matching

- Computer Science, Mathematics
- 2015

23

On the Approximation Performance of Degree Heuristics for Matching

- Computer Science, Mathematics
- 2015

1

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 27 REFERENCES

Online vertex-weighted bipartite matching and single-bid budgeted allocations

- Mathematics, Computer Science
- 2011

147

Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs

- Computer Science, Mathematics
- 2011

196

Randomized Greedy Algorithms for the Maximum Matching Problem with New Analysis

- Mathematics, Computer Science
- 2012

32