Constant-Time Approximation Algorithms via Local Improvements
暂无分享,去创建一个
[1] Bernard Chazelle,et al. Approximating the Minimum Spanning Tree Weight in Sublinear Time , 2001, ICALP.
[2] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..
[3] Piotr Indyk,et al. Sublinear time algorithms for metric space problems , 1999, STOC '99.
[4] Andrzej Czygrinow,et al. A Fast Distributed Algorithm for Approximating the Maximum Matching , 2004, ESA.
[5] Dana Ron,et al. Property Testing in Bounded Degree Graphs , 1997, STOC.
[6] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.
[7] Piotr Indyk,et al. Facility Location in Sublinear Time , 2005, ICALP.
[8] Dana Ron,et al. On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms , 2007, Electron. Colloquium Comput. Complex..
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] Artur Czumaj,et al. Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time , 2009, SIAM J. Comput..
[11] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.
[12] Andrzej Czygrinow,et al. Distributed Algorithm for Better Approximation of the Maximum Matching , 2003, COCOON.
[13] Peter Sanders,et al. A simpler linear time 2/3-epsilon approximation for maximum weight matching , 2004, Inf. Process. Lett..
[14] Dana Ron,et al. Distance Approximation in Bounded-Degree and General Sparse Graphs , 2006, APPROX-RANDOM.
[15] Roger Wattenhofer,et al. The price of being near-sighted , 2006, SODA '06.
[16] Richard M. Karp,et al. A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.