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}
}
  • T.-H. Hubert Chan, F. Chen, +1 author Zhichao Zhao
  • Published 2014
  • Computer Science, Mathematics
  • ArXiv
  • 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
    Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity
    5
    Online Vertex-Weighted Bipartite Matching: Beating 1-1/e with Random Arrivals
    22
    Online Vertex-Weighted Bipartite Matching
    5
    The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm
    17
    How to match when all vertices arrive online
    43
    Near Optimal Algorithms for Online Maximum Weighted b-Matching
    2
    Beating Ratio 0.5 for Weighted Oblivious Matching Problems
    11
    Online Matroid Intersection: Beating Half for Random Arrival
    16

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 27 REFERENCES
    Online budgeted matching in random input models with applications to Adwords
    255
    Online vertex-weighted bipartite matching and single-bid budgeted allocations
    147
    Online bipartite matching with unknown distributions
    164
    Randomized Greedy Matching
    60
    Matching with Our Eyes Closed
    27
    Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs
    196
    Randomized Greedy Algorithms for the Maximum Matching Problem with New Analysis
    32
    Resource augmentation for weighted flow-time explained by dual fitting
    102
    An optimal algorithm for on-line bipartite matching
    567
    Randomized Greedy Matching II
    47