Abstract combinatorial programs and efficient property testers

Property testing is a relaxation of classical decision problems which aims at distinguishing between functions having a predetermined property and functions being far from any function having the property. In this paper we present a novel framework for analyzing property testing algorithms with one-sided error. Our framework is based on a connection of property testing and a new class of problems which we call abstract combinatorial programs. We show that if the problem of testing a property can be reduced to an abstract combinatorial program of small dimension, then the property has an efficient tester. We apply our framework to a variety of classical combinatorial problems. Among others, we present efficient property testing algorithms for geometric clustering problems, the reversal distance problem, and graph and hypergraph coloring problems. We also prove that, informally, any hereditary graph property can be efficiently tested if and only if it can be reduced to an abstract combinatorial program of small size. Our framework allows us to analyze all our testers in a unified way and the obtained complexity bounds either match or improve the previously known bounds. We believe that our framework will help to better understand the structure of efficiently testable properties.

[1]  Noga Alon.  Testing subgraphs in large graphs , 2002, Random Struct. Algorithms.

[2]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[3]  Piotr Indyk,et al.  Sublinear time algorithms for metric space problems , 1999, STOC '99.

[4]  Noga Alon,et al.  Testing of clustering , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[5]  Luca Trevisan,et al.  Three Theorems regarding Testing Graph Properties , 2001, Electron. Colloquium Comput. Complex..

[6]  Claire Mathieu,et al.  A Randomized Approximation Scheme for Metric MAX-CUT , 1998, FOCS.

[7]  Oded Goldreich,et al.  Combinatorial property testing (a survey) , 1997, Randomization Methods in Algorithm Design.

[8]  Alan M. Frieze,et al.  The regularity lemma and approximation schemes for dense problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[9]  Petra Mutzel,et al.  Computational Molecular Biology , 1996 .

[10]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[11]  Noga Alon,et al.  Testing satisfiability , 2002, SODA '02.

[12]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Artur Czumaj,et al.  Testing Hypergraph Coloring , 2001, ICALP.

[15]  Noga Alon,et al.  Random sampling and approximation of MAX-CSP problems , 2002, STOC '02.

[16]  P.A. Pevzner,et al.  Open combinatorial problems in computational molecular biology , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[17]  Yoshiharu Kohayakawa,et al.  Efficient Testing of Hypergraphs , 2002, ICALP.

[18]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[19]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[20]  Noga Alon,et al.  Efficient Testing of Large Graphs , 2000, Comb..

[21]  Ronitt Rubinfeld,et al.  Sublinear-time approximation of Euclidean minimum spanning tree , 2003, SODA '03.

[22]  Pavel A. Pevzner,et al.  Computational molecular biology : an algorithmic approach , 2000 .

[23]  Piotr Indyk.  A sublinear time approximation scheme for clustering in metric spaces , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).