How to match when all vertices arrive online
暂无分享,去创建一个
[1] Claire Mathieu,et al. On-line bipartite matching made simple , 2008, SIGA.
[2] Andrew McGregor,et al. Finding Graph Matchings in Data Streams , 2005, APPROX-RANDOM.
[3] SaberiAmin,et al. AdWords and generalized online matching , 2007 .
[4] Sundar Vishwanathan,et al. On Randomized Algorithms for Matching in the Online Preemptive Model , 2015, ESA.
[5] Martin E. Dyer,et al. Randomized Greedy Matching II , 1995, Random Struct. Algorithms.
[6] Ashwinkumar Badanidiyuru,et al. Buyback Problem - Approximate Matroid Intersection with Cancellation Costs , 2010, ICALP.
[7] Nikhil R. Devanur,et al. Randomized Primal-Dual analysis of RANKING for Online BiPartite Matching , 2013, SODA.
[8] Gagan Goel,et al. Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations , 2010, SODA.
[9] Fei Chen,et al. Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints , 2013, SODA.
[10] Aranyak Mehta,et al. Online budgeted matching in random input models with applications to Adwords , 2008, SODA '08.
[11] Mohammad Taghi Hajiaghayi,et al. Beating Ratio 0.5 for Weighted Oblivious Matching Problems , 2016, ESA.
[12] Leah Epstein,et al. Improved Bounds for Online Preemptive Matching , 2012, STACS.
[13] Mohammad Mahdian,et al. Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs , 2011, STOC '11.
[14] Martin E. Dyer,et al. Randomized Greedy Matching , 1991, Random Struct. Algorithms.
[15] Richard M. Karp,et al. An optimal algorithm for on-line bipartite matching , 1990, STOC '90.
[16] Yajun Wang,et al. Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm , 2015, ICALP.
[17] Joseph Naor,et al. Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue , 2007, ESA.
[18] Nikhil R. Devanur,et al. Online matching with concave returns , 2012, STOC '12.
[19] Aranyak Mehta,et al. Online bipartite matching with unknown distributions , 2011, STOC '11.
[20] Niv Buchbinder,et al. Online Algorithms for Maximum Cardinality Matching with Edge Arrivals , 2017, ESA.