Constant-Time Approximation Algorithms for the Optimum Branching Problem on Sparse Graphs
暂无分享,去创建一个
[1] Krzysztof Onak,et al. A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size , 2011, SODA.
[2] Ito Hiro,et al. Testing k-Edge-Connectivity of Digraphs , 2007 .
[3] Christian Sohler,et al. Every property of hyperfinite graphs is testable , 2011, STOC '11.
[4] Yuichi Yoshida,et al. Property Testing on k-Vertex-Connectivity of Graphs , 2010, Algorithmica.
[5] Dana Ron,et al. Testing Eulerianity and connectivity in directed sparse graphs , 2011, Theor. Comput. Sci..
[6] Shin-ichi Tanigawa,et al. Constant-Time Algorithms for Sparsity Matroids , 2011, ICALP.
[7] Dana Ron,et al. Property Testing in Bounded Degree Graphs , 1997, STOC.
[8] Christian Sohler,et al. Property-Testing in Sparse Directed Graphs: 3-Star-Freeness and Connectivity , 2013, ArXiv.
[9] Robert E. Tarjan,et al. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..
[10] Bernard Chazelle,et al. Approximating the Minimum Spanning Tree Weight in Sublinear Time , 2001, ICALP.
[11] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[12] Krzysztof Onak,et al. Constant-Time Approximation Algorithms via Local Improvements , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[13] Nasir D. Memon,et al. Cluster-based delta compression of a collection of files , 2002, Proceedings of the Third International Conference on Web Information Systems Engineering, 2002. WISE 2002..
[14] Torsten Suel,et al. Approximate maximum weight branchings , 2006, Inf. Process. Lett..
[15] Dana Ron,et al. Property Testing in Bounded Degree Graphs , 2002, STOC '97.
[16] Dana Ron,et al. Tight Bounds for Testing Bipartiteness in General Graphs , 2004, SIAM J. Comput..
[17] Yuichi Yoshida,et al. An improved constant-time approximation algorithm for maximum~matchings , 2009, STOC '09.