A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size
暂无分享,去创建一个
Krzysztof Onak | Ronitt Rubinfeld | Dana Ron | Michal Rosen | D. Ron | R. Rubinfeld | M. Rosen | Krzysztof Onak
[1] Dana Ron,et al. Approximating the distance to properties in bounded-degree and general sparse graphs , 2009, TALG.
[2] Krzysztof Onak,et al. Constant-Time Approximation Algorithms via Local Improvements , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[3] Gábor Elek,et al. Parameter testing in bounded degree graphs of subexponential growth , 2007, Random Struct. Algorithms.
[4] Artur Czumaj,et al. Estimating the weight of metric minimum spanning trees in sublinear-time , 2004, STOC '04.
[5] Bernard Chazelle,et al. Approximating the Minimum Spanning Tree Weight in Sublinear Time , 2001, ICALP.
[6] Artur Czumaj,et al. Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs , 2009, SIAM J. Comput..
[7] Roger Wattenhofer,et al. The price of being near-sighted , 2006, SODA '06.
[8] Andrzej Czygrinow,et al. Fast Distributed Approximations in Planar Graphs , 2008, DISC.
[9] Krzysztof Onak,et al. Local Graph Partitions for Approximation and Testing , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[10] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[11] Christian Sohler,et al. Every property of hyperfinite graphs is testable , 2011, STOC '11.
[12] Yuichi Yoshida,et al. An improved constant-time approximation algorithm for maximum~matchings , 2009, STOC '09.
[13] Michael Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem , 1986, SIAM J. Comput..
[14] Ronitt Rubinfeld,et al. Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time , 2005, SIAM J. Comput..
[15] Uriel Feige,et al. On sums of independent random variables with unbounded variance, and estimating the average degree in a graph , 2004, STOC '04.
[16] Yuichi Yoshida,et al. Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP , 2010, STOC '11.
[17] G. Elek. Parameter testing in bounded degree graphs of subexponential growth , 2010 .
[18] Dana Ron,et al. Counting stars and other small subgraphs in sublinear time , 2010, SODA '10.
[19] Dana Ron,et al. On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms , 2007, Electron. Colloquium Comput. Complex..
[20] Oded Schramm,et al. Every minor-closed property of sparse graphs is testable , 2008, Electron. Colloquium Comput. Complex..
[21] Dana Ron,et al. Approximating average parameters of graphs , 2008, Random Struct. Algorithms.