An improved constant-time approximation algorithm for maximum~matchings
暂无分享,去创建一个
[1] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[2] Martin E. Dyer,et al. Randomized Greedy Matching II , 1995, Random Struct. Algorithms.
[3] Dana Ron,et al. On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms , 2007, Electron. Colloquium Comput. Complex..
[4] Ronitt Rubinfeld,et al. Algorithms column: sublinear time algorithms , 2003, SIGA.
[5] Artur Czumaj,et al. Sublinear-Time Algorithms , 2006, Bull. EATCS.
[6] R. Häggkvist,et al. Bipartite graphs and their applications , 1998 .
[7] Piotr Indyk,et al. Sublinear time algorithms for metric space problems , 1999, STOC '99.
[8] Martin E. Dyer,et al. Randomized Greedy Matching , 1991, Random Struct. Algorithms.
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] Dana Ron,et al. Distance Approximation in Bounded-Degree and General Sparse Graphs , 2006, APPROX-RANDOM.
[11] Krzysztof Onak,et al. Constant-Time Approximation Algorithms via Local Improvements , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[12] Oded Goldreich,et al. Combinatorial property testing (a survey) , 1997, Randomization Methods in Algorithm Design.
[13] Dana Ron,et al. Property Testing in Bounded Degree Graphs , 1997, STOC.
[14] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[15] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..