Sublinear time algorithms

SIAM Journal on Discrete Mathematics

Volumn 25, Issue 4, 2011, Pages 1562-1588

  Rubinfeld, Ronitt ^a   Shapira, Asaf ^b,c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation algorithms; Property testing; Randomized algorithms; Sublinear time algorithms

Indexed keywords

PROPERTY-TESTING; RANDOMIZED ALGORITHMS; SUBLINEAR TIME ALGORITHMS;

MATHEMATICAL TECHNIQUES;

APPROXIMATION ALGORITHMS;

EID: 84855660450     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/100791075     Document Type: Article

References (119)

1. N. Ailon and B. Chazelle, Information theory in property testing and monotonicity testing in higher dimensions, Inform. Comput., 204 (2006), pp. 1704-1717. (Pubitemid 44557029)
2. N. Ailon, B. Chazelle, S. Comandur, and D. Liu, Estimating the distance to a monotone function, Random Structures Algorithms, 31 (2007), pp. 371-383.
3. N. Alon, Testing subgraphs in large graphs, Random Structures Algorithms, 21 (2002), pp. 359-370. (Pubitemid 37340778)
4. N. Alon, On constant time approximation of parameters of bounded degree graphs, in Property Testing-Current Research and Surveys, O. Goldreich, ed., Lecture Notes in Comput. Sci. 6390, Springer, New York, 2010, pp. 234-239.
5. N. Alon, R. A. Duke, H. Lefmann, V. Rödl, and R. Yuster, The algorithmic aspects of the regularity lemma, J. Algorithms, 16 (1994), pp. 80-109.
6. N. Alon, E. Fischer, M. Krivelevich, and M. Szegedy, Efficient testing of large graphs, Combinatorica, 20 (2000), pp. 451-476.
7. N. Alon, E. Fischer, I. Newman, and A. Shapira, A combinatorial characterization of the testable graph properties: It's all about regularity, SIAM J. Comput., 39 (2009), pp. 143-167.
8. N. Alon, T. Kaufman, M. Krivilevich, S. Litsyn, and D. Ron, Testing low-degree polynomials over gf(2), in Proceedings of RANDOM '03, Princeton, NJ, Lecture Notes in Comput. Sci. 2764, Springer, New York, 2003, pp. 188-199.
9. N. Alon, T. Kaufman, M. Krivelevich, and D. Ron, Testing triangle-freeness in general graphs, SIAM J. Discrete Math., 22 (2008), pp. 786-819.
10. N. Alon and M. Krivelevich, Testing k-colorability, SIAM J. Discrete Math., 15 (2002), pp. 211-227. (Pubitemid 35327184)
11. N. Alon, P. Seymour, and R. Thomas, A separator theorem for graphs with an excluded minor and its applications, in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, Baltimore, MD, 1990, pp. 293-299. (Pubitemid 20729134)
12. N. Alon and A. Shapira, Testing subgraphs in directed graphs, J. Comput. System Sci., 69 (2004), pp. 354-382.
13. N. Alon and A. Shapira, Every monotone graph property is testable, SIAM J. Comput., 38 (2008), pp. 505-522.
14. N. Alon and A. Shapira, A characterization of easily testable induced subgraphs, Combin. Probab. Comput., 15 (2006), pp. 791-805. (Pubitemid 44621823)
15. N. Alon and A. Shapira, A characterization of the (natural) graph properties testable with one-sided error, SIAM J. Comput., 37 (2008), pp. 1703-1727.
16. A. Andoni, R. Krauthgamer, and K. Onak, Polylogarithmic approximation for edit distance and the asymmetric query complexity, in Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science, Las Vegas, NV, 2010, pp. 377-386.
17. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and the hardness of approximation problems, J. ACM, 45 (1998), pp. 501-555. (Pubitemid 128506634)
18. S. Arora and M. Sudan, Improved low degree testing and its applications, in Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, TX, 1997, pp. 485-495.
19. T. Austin and T. Tao, Testability and repair of hereditary hypergraph properties, Random Struct. Algorithms, 36 (2010), pp. 373-463.
20. L. Babai, L. Fortnow, L. A. Levin, and M. Szegedy, Checking computations in polylogarithmic time, in Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, New Orleans, LA, 1991, pp. 21-31.
21. T. Batu, P. Berenbrink, and C. Sohler, A sublinear-time algorithm for bin packing, Theoret. Comput. Sci., 410 (2009), pp. 5082-5092.
22. T. Batu, F. Ergun, J. Kilian, A. Magen, S. Raskhodnikova, R. Rubinfeld, and R. Sami, A sublinear algorithm for weakly approximating edit distance, in Proceedings of the Thirty-Fifth Annual ACM Symposium on the Theory of Computing, San Diego, 2003, pp. 316-324.
23. T. Batu, R. Rubinfeld, and P. White, Fast approximate PCPs for multidimensional binpacking problems, Inform. and Comput., 196 (2005), pp. 42-56.
24. M. Bellare, D. Coppersmith, J. Håstad, M. Kiwi, and M. Sudan, Linearity testing over characteristic two, IEEE Trans. Inform. Theory, 42 (1996), pp. 1781-1795.
25. I. Ben-Eliezer, T. Kaufman, M. Krivelevich, and D. Ron, Comparing the strength of query types in property testing: The case of testing k-colorability, in Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 2008, pp. 1213-1222.
26. M. Ben-Or, D. Coppersmith, M. Luby, and R. Rubinfeld, Non-Abelian homomorphism testing, and distributions close to their self-convolutions, Random Structures Algorithms, 32 (2008), pp. 49-70.
27. E. Ben-Sasson and M. Sudan, Short PCPs with polylog query complexity, SIAM J. Comput., 38 (2008), pp. 551-607.
28. I. Benjamini, O. Schramm, and A. Shapira, Every minor-closed property of sparse graphs is testable, in Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, BC, 2008, pp. 393-402.
29. A. Bhattacharyya, V. Chen, M. Sudan, and N. Xie, Testing linear-invariant nonlinear properties, Theory Comput., 7 (2011), pp. 75-99.
30. A. Bhattacharyya, E. Grigorescu, K. Jung, S. Raskhodnikova, and D. P. Woodruff, Transitive-closure spanners, in Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, New York, 2009, pp. 932-941.
31. A. Bhattacharyya and N. Xie, Lower bounds for testing triangle-freeness in Boolean functions, in Proceedings of the Twenty-first Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, 2010, pp. 87-98.
32. M. Blum, M. Luby, and R. Rubinfeld, Self-testing/correcting with applications to numerical problems, J. Comput. System Sci., 47 (1993), pp. 549-595.
33. A. Bogdanov, K. Obata, and L. Trevisan, A lower bound for testing 3-colorability in bounded-degree graphs, in Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, Vancouver, BC, 2002, pp. 93-102.
34. B. Bollobás, P. Erdös, M. Simonovits, and E. Szemerédi, Extremal graphs without large forbidden subgraphs, Ann. Discrete Math., 3 (1978), pp. 29-41.
35. W. G. Brown, P. Erdös, and V. T. Sós, On the existence of triangulated spheres in 3-graphs and related problems, Period. Math. Hungar., 3 (1973), pp. 221-228.
36. E. Ben Sasson, M. Sudan, S. Vadhan, and A. Wigderson, Randomness-efficient low degree tests and short PCP's via epsilon-biased sets, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, San Diego, 2003, pp. 612-621.
37. B. Chazelle, D. Liu, and A. Magen, Sublinear geometric algorithms, SIAM J. Comput., 35 (2006), pp. 627-646. (Pubitemid 43952264)
38. B. Chazelle, R. Rubinfeld, and L. Trevisan, Approximating the minimum spanning tree weight in sublinear time, SIAM J. Comput., 34 (2005), pp. 1370-1379. (Pubitemid 43003146)
39. D. Coppersmith, handwritten notes, 1989.
40. A. Czumaj, F. Ergun, L. Fortnow, A. Magen, I. Newman, R. Rubinfeld, and C. Sohler, Approximating the weight of the Euclidean minimum spanning tree in sublinear time, SIAM J. Comput., 35 (2005), pp. 91-109.
41. A. Czumaj and C. Sohler, Testing expansion in bounded-degree graphs, in Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, Providence, RI, 2007, pp. 570-578.
42. A. Czumaj and C. Sohler, Estimating the weight of metric minimum spanning trees in sublinear time, SIAM J. Comput., 39 (2009), pp. 904-922.
43. A. Czumaj, A. Shapira, and C. Sohler, Testing hereditary properties of nonexpanding bounded-degree graphs, SIAM J. Comput., 38 (2009), pp. 2499-2510.
44. I. Dinur, The PCP theorem by gap amplification, J. ACM, 54 (2007), p. 12.
45. Y. Dodis, O. Goldreich, E. Lehman, S. Raskhodnikova, D. Ron, and A. Samorodnitsky, Improved testing algorithms for monotonicity, in Proceedings of RANDOM 1999, Lecture Notes in Comput. Sci. 1671, Springer, New York, 1999, pp. 97-108.
46. G. Elek, Parameter testing in bounded degree graphs of subexponential growth, Random Structures Algorithms, 37 (2010), pp. 248-270.
47. P. Erdös, On circuits and subgraphs of chromatic graphs, Mathematika, 9 (1962), pp. 170-175.
48. F. Ergün, S. Kannan, S. R. Kumar, R. Rubinfeld, and M. Viswanathan, Spot-checkers, J. Comput. System Sci., 60 (2000), pp. 717-751.
49. F. Ergün, S. R. Kumar, and R. Rubinfeld, Checking approximate computations of polynomials and functional equations, SIAM J. Comput, 31 (2001), pp. 550-576. (Pubitemid 33782965)
50. E. Fischer, The art of uninformed decisions: A primer to property testing, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 75 (2001), pp. 97-126.
51. E. Fischer, On the strength of comparisons in property testing, Inform. and Comput., 189 (2004), pp. 107-116.
52. E. Fischer, E. Lehman, I. Newman, S. Raskhodnikova, R. Rubinfeld, and A. Samorodnitsky, Monotonicity testing over general poset domains, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, Montréal, QC, 2002, pp. 474-483. (Pubitemid 35009408)
53. G. Frahling, P. Indyk, and C. Sohler, Sampling in dynamic data streams and applications, in Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, 2005, pp. 142-149. (Pubitemid 43283455)
54. A. Frieze and R. Kannan, Quick approximation to matrices and applications, Combinatorica, 19 (1999), pp. 175-220.
55. E. Fischer and A. Matsliah, Testing graph isomorphism, in Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, 2006, pp. 299-308. (Pubitemid 43275251)
56. E. Fischer, A. Matsliah, and A. Shapira, Approximate hypergraph partitioning and applications, in Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, Providence, RI, 2007, pp. 579-589.
57. E. Fischer and I. Newman, Testing versus estimation of graph properties, SIAM J. Comput, 37 (2007), pp. 482-501. (Pubitemid 351584854)
58. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness, W. H. Freeman, San Francisco, 1979.
59. O. Goldreich, Combinatorial property testing-A survey, in Randomization Methods in Algorithm Design, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., AMS, Providence, RI, 1998, pp. 45-60.
60. O. Goldreich, S. Goldwasser, E. Lehman, D. Ron, and A. Samordinsky, Testing monotonicity, Combinatorica, 20 (2000), pp. 301-337.
61. O. Goldreich, S. Goldwasser, and D. Ron, Property testing and its connection to learning and approximation, J. ACM, 45 (1998), pp. 653-750. (Pubitemid 128488791)
62. O. Goldreich, M. Krivelevich, I. Newman, and E. Rozenberg, Hierarchy theorems for property testing, in Proceedings of RANDOM 2009, Berkeley, CA, pp. 504-519.
63. O. Goldreich and D. Ron, On testing expansion in bounded-degree graphs, Electron. Colloq. Comput. Complexity, 7 (2000).
64. O. Goldreich and D. Ron, Property testing in bounded degree graphs, Algorithmica, 32 (2002), pp. 302-343.
65. O. Goldreich and D. Ron, A sublinear bipartiteness tester for bounded degree graphs, Combinatorica, 19 (1999), pp. 335-373.
66. O. Goldreich and M. Sudan, Locally testable codes and PCPs of almost-linear length, J. ACM, 53 (2006), pp. 558-655. (Pubitemid 44435052)
67. O. Goldreich and L. Trevisan, Three theorems regarding testing graph properties, in Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, Las Vegas, NV, 2001, pp. 460-469. (Pubitemid 33068407)
68. T. Gowers, Hypergraph regularity and the multidimensional Szemerédi theorem, Ann. of Math. (2), 166 (2007), pp. 897-946.
69. B. Green, A Szemerédi-type regularity lemma in Abelian groups, Geom. Funct. Anal., 15 (2005), pp. 340-376. (Pubitemid 41124600)
70. S. Halevy and E. Kushilevitz, Testing monotonicity over graph products, in Proceedings of ICALP, Lecture Notes in Comput. Sci. 3142, Springer, New York, 2004, pp. 721-732.
71. A. Hassidim, J. A. Kelner, H. N. Nguyen, and K. Onak, Local graph partitions for approximation and testing, in Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, Atlanta, GA, 2009, pp. 22-31.
72. J. Hastad and A. Wigderson, Simple analysis of graph tests for linearity and PCP, Random Structures Algorithms, 22 (2003), pp. 139-160.
73. P. Indyk, Sublinear time algorithms for metric space problems, in Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, Atlanta, GA, 1999, pp. 428-434.
74. C. S. Jutla, A. C. Patthak, A. Rudra, and D. Zuckerman, Testing low-degree polynomials over prime fields, in Proceedings of the Forty-Fifth Annual Symposium on Foundations of Computer Science, Rome, 2004, pp. 423-432. (Pubitemid 40575304)
75. S. Kale and C. Seshadhri, An expansion tester for bounded-degree graphs, in Proceedings of the 35th International Colloquium on Automata, Languages, and Programming, Reykjavik, Iceland, 2008, pp. 527-538.
76. T. Kaufman and S. Litsyn, Almost orthogonal linear codes are locally testable, in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, Pittsburgh, PA, 2005, pp. 317-326. (Pubitemid 44375742)
77. T. Kaufman, S. Litsyn, and N. Xie, Breaking the-soundness bound of the linearity test over GF(2), SIAM J. Comput., 39 (2010), pp. 1988-2003.
78. T. Kaufman and D. Ron, Testing polynomials over general fields, in Proceedings of the Forty-Fifth Annual Symposium on Foundations of Computer Science, Rome, 2004, pp. 413-422. (Pubitemid 40575303)
79. T. Kaufman and M. Sudan, Sparse random linear codes are locally decodable and testable, in Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, Providence, RI, 2007, pp. 590-600.
80. T. Kaufman and M. Sudan, Algebraic property testing: The role of invariance, in Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, BC, 2008, pp. 403-412.
81. M. Kiwi, F. Magniez, and M. Santha, Approximate testing with error relative to input size, J. Comput. System Sci., 66 (2003), pp. 371-392. (Pubitemid 41161754)
82. Y.Kohayakawa, B.Nagle, V.Rödl, M. Schacht, and J. Skokan, The hypergraph regularity method and its applications, Proc. Natl. Acad. Sci. USA, 102 (2003), pp. 8109-8113.
83. L. Komlós, Covering odd cycles, Combinatorica, 17 (1997), pp. 393-400.
84. S. Kopparty and S. Saraf, Tolerant linearity testing and locally testable codes, in APPROXRANDOM 2009, Berkeley, CA, Lecture Notes in Comput. Sci. 5687, Springer, New York, 2009, pp. 601-614.
85. S. Kopparty and S. Saraf, Local list-decoding and testing of sparse random linear codes from high-error, in Proceedings of the 42nd Annual ACM Symposium on Theory of Computing, Cambridge, MA, 2010, pp. 417-426.
86. T. Kaufman, M. Krivelevich, and D. Ron, Tight bounds for testing bipartiteness in general graphs, SIAM J. Comput., 33 (2004), pp. 1441-1483. (Pubitemid 40026771)
87. F. Kuhn, T. Moscibroda, and R. Wattenhofer, The price of being near-sighted, in Proceedings of the Seventeenth Annual ACM/SIAM Symposium on Discrete Algorithms, Miami, FL, 2006, pp. 980-989. (Pubitemid 43275324)
88. D. Král', O. Serra, and L. Vena, A combinatorial proof of the removal lemma for groups, J. Combin. Theory Ser. A, 116 (2009), pp. 971-978.
89. D. Král', O. Serra, and L. Vena, A removal lemma for linear systems over finite fields, Proc. VI J. Mat. Discreta Algorítmica, 2008, pp. 417-424.
90. R. J. Lipton and R. E. Tarjan, A separator theorem for planar graphs, SIAM J. Appl. Math., 36 (1979), pp. 177-189.
91. L. Lovász and B. Szegedy, Limits of dense graph sequences, J. Combin. Theory Ser. B, 96 (2006), pp. 933-957. (Pubitemid 44858105)
92. M. Luby, A simple parallel algorithm for the maximal independent set problem, SIAM J. Comput., 15 (1986), pp. 1036-1053. (Pubitemid 17465853)
93. S. Marko and D. Ron, Approximating the distance to properties in bounded-degree and general sparse graphs, ACM Trans. Algorithms, 5 (2009), 22.
94. O. Meir, Combinatorial construction of locally testable codes, SIAM J. Comput., 39 (2009), pp. 491-544.
95. N. Mishra, D. Oblinger, and L. Pitt, Sublinear time approximate clustering, in Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, Washington, DC, 2001, pp. 439-447.
96. A. Nachmias and A. Shapira, Testing the expansion of a graph, Inform. and Comput., 208 (2010), pp. 309-314.
97. H. N. Nguyen and K. Onak, Constant-time approximation algorithms via local improvements, in Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, Philadelphia, PA, 2008, pp. 327-336.
98. M. Parnas and D. Ron, Testing the diameter of graphs, Random Structures Algorithms, 20 (2002), pp. 165-183. (Pubitemid 37340805)
99. M. Parnas and D. Ron, Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms, Theoret. Comput. Sci., 381 (2007), pp. 183-196. (Pubitemid 47126208)
100. M. Parnas, D. Ron, and R. Rubinfeld, Tolerant property testing and distance approximation, J. Comput. System Sci., 72 (2006), pp. 1012-1042. (Pubitemid 44163575)
101. A. Polischuk and D. Spielman, Nearly linear-size holographic proofs, in Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, Montréal, QC, 1994, pp. 194-203.
102. S. Raskhodnikova, D. Ron, R. Rubinfeld, and A. Smith, Sublinear algorithms for string compressibility and the distribution support size, in Proceedings of APPROX-RANDOM, Princeton, NJ, Lecture Notes in Comput. Sci. 4627, Springer, New York, 2007, pp. 609-623.
103. S. Raskhodnikova, D. Ron, A. Shpilka, and A. Smith, Strong lower bounds for approximating distribution support size and the distinct elements problem, in Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, Providence, RI, 2007, pp. 559-569.
104. R. Raz and S. Safra, A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP, in Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, El Paso, TX, 1997, pp. 475-484.
105. V. Rödl and R. Duke, On graphs with small subgraphs of large chromatic number, Graphs Combin., 1 (1985), pp. 91-96.
106. V. Rödl and M. Schacht, Property testing in hypergraphs and the removal lemma, in Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, CA, 2007, pp. 488-495. (Pubitemid 47630768)
107. D. Ron, Property testing, in Handbook on Randomization, Volume II, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2001, pp. 597-649.
108. D. Ron, Property testing: A learning theory perspective, Found. Trends Machine Learning, 1 (2008), pp. 307-402.
109. K. F. Roth, On certain sets of integers, J. London Math. Soc., 28 (1953), pp. 104-109.
110. R. Rubinfeld, On the robustness of functional equations, SIAM J. Comput., 28 (1999), pp. 1972-1997. (Pubitemid 129306122)
111. R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM J. Comput., 25 (1996), pp. 252-271. (Pubitemid 126577271)
112. I. Ruzsa and E. Szemerédi, Triple systems with no six points carrying three triangles, in Combinatorics (Keszthely, 1976), Coll. Math. Soc. J. Bolyai 18, Volume II, North-Holland, Amsterdam, pp. 939-945.
113. A. Samorodnitsky and L. Trevisan, A PCP characterization of NP with optimal amortized query complexity, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, Portland, OR, 2000, pp. 191-199.
114. A. Shapira, Green's conjecture and testing linear-invariant properties, in Proceedings of the 41st Annual ACM Symposium on Theory of Computing, Bethesda, MD, 2009, pp. 159-166.
115. A. Shpilka and A. Wigderson, Derandomizing homomorphism testing in general groups, in Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, 2004, pp. 427-435.
116. M. Sudan, Invariance in property testing, in Property Testing: Current Research and Surveys, O. Goldreich, ed., Lecture Notes in Comput. Sci. 6390, Springer, New York, 2010, pp. 211-227.
117. E. Szemerédi, Regular partitions of graphs, in Proceedings of the Colloque Inter. CNRS, J. C. Bermond, J. C. Fournier, M. Las Vergnas, and D. Sotteau, eds., CNRS, Paris, 1978, pp. 399-401.
118. T. Tao, A variant of the hypergraph removal lemma, J. Combin. Theory Ser. A, 113 (2006), pp. 1257-1280. (Pubitemid 44145331)
119. Y. Yoshida, M. Yamamoto, and H. Ito, An improved constant-time approximation algorithm for maximum matchings, in Proceedings of the 41st Annual ACM Symposium on Theory of Computing, Bethesda, MD, 2009, pp. 225-234.