暂无分享,去创建一个
[1] Ashwinkumar Badanidiyuru,et al. Buyback Problem - Approximate Matroid Intersection with Cancellation Costs , 2010, ICALP.
[2] A. Kemper,et al. On Graph Problems in a Semi-streaming Model , 2015 .
[3] Andrew Chi-Chih Yao,et al. Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[4] Fei Chen,et al. Ranking on Arbitrary Graphs: Rematch via Continuous LP with Monotone and Boundary Condition Constraints , 2013, SODA.
[5] Andrew McGregor,et al. Finding Graph Matchings in Data Streams , 2005, APPROX-RANDOM.
[6] Leah Epstein,et al. Improved Bounds for Online Preemptive Matching , 2012, STACS.
[7] Joan Feigenbaum,et al. On graph problems in a semi-streaming model , 2005, Theor. Comput. Sci..
[8] Ashwinkumar Badanidiyuru Varadaraja. Buyback problem: approximate matroid intersection with cancellation costs , 2011, ICALP 2011.
[9] Joseph Naor,et al. The Design of Competitive Online Algorithms via a Primal-Dual Approach , 2009, Found. Trends Theor. Comput. Sci..
[10] Richard M. Karp,et al. An optimal algorithm for on-line bipartite matching , 1990, STOC '90.
[11] Matthias Poloczek,et al. Randomized Greedy Algorithms for the Maximum Matching Problem with New Analysis , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.