暂无分享,去创建一个
Leah Epstein | Danny Segev | Asaf Levin | Oren Weimann | D. Segev | O. Weimann | L. Epstein | Asaf Levin | Oren Weimann
[1] S. Muthukrishnan,et al. Data streams: algorithms and applications , 2005, SODA '03.
[2] Marek Chrobak,et al. Incremental Medians via Online Bidding , 2007, Algorithmica.
[3] Leah Epstein,et al. Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model , 2009, SIAM J. Discret. Math..
[4] Guochuan Zhang,et al. Optimal online-list batch scheduling , 2009, Inf. Process. Lett..
[5] Ashwinkumar Badanidiyuru,et al. Buyback Problem - Approximate Matroid Intersection with Cancellation Costs , 2010, ICALP.
[6] Leah Epstein,et al. Randomized algorithms for online bounded bidding , 2010, Inf. Process. Lett..
[7] Leah Epstein,et al. On the max coloring problem , 2012, Theor. Comput. Sci..
[8] F. Burk. Euler's Constant , 1985 .
[9] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[10] Michael Crouch,et al. Improved Streaming Algorithms for Weighted Matching, via Unweighted Matching , 2014, APPROX-RANDOM.
[11] Joseph Naor,et al. An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching , 2007, ESA.
[12] Allan Borodin,et al. On Randomization in On-Line Computation , 1999, Inf. Comput..
[13] Andrew McGregor,et al. Finding Graph Matchings in Data Streams , 2005, APPROX-RANDOM.
[14] Sudipto Guha,et al. Linear programming in the semi-streaming model with application to the maximum matching problem , 2011, Inf. Comput..
[15] A. Kemper,et al. On Graph Problems in a Semi-streaming Model , 2015 .
[16] Joseph Naor,et al. A Randomized O(log2k)-Competitive Algorithm for Metric Bipartite Matching , 2012, Algorithmica.
[17] 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).
[18] Junesang Choi,et al. ON THE EULER'S CONSTANT , 1997 .
[19] Guy Kortsarz,et al. Sum Coloring Interval and k-Claw Free Graphs with Application to Scheduling Dependent Jobs , 2003, Algorithmica.
[20] Mariano Zelke,et al. Weighted Matching in the Semi-Streaming Model , 2007, Algorithmica.
[21] Bala Kalyanasundaram,et al. Online Weighted Matching , 1993, J. Algorithms.
[22] Feifeng Zheng,et al. Online interval scheduling: randomized and multiprocessor cases , 2008, J. Comb. Optim..
[23] Leah Epstein,et al. Improved randomized results for the interval selection problem , 2010, Theor. Comput. Sci..
[24] Richard M. Karp,et al. An optimal algorithm for on-line bipartite matching , 1990, STOC '90.
[25] Samir Khuller,et al. On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages , 1991, Theor. Comput. Sci..
[26] Sudipto Guha,et al. Laminar Families and Metric Embeddings: Non-bipartite Maximum Matching Problem in the Semi-Streaming Model , 2011, ArXiv.