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. 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 problems. We present efficient property testing algorithms for geometric clustering problems, for the reversal distance problem, and for 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. Furthermore, even if the asymptotic complexity of the testers is not improved, the obtained proofs are significantly simpler than the previous ones. We believe that our framework will help to understand the structure of efficiently testable properties.

[1]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[2]  Ronald L. Rivest,et al.  On Recognizing Graph Properties from Adjacency Matrices , 1976, Theor. Comput. Sci..

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

[4]  John M. Lewis,et al.  The Node-Deletion Problem for Hereditary Properties is NP-Complete , 1980, J. Comput. Syst. Sci..

[5]  David Haussler,et al.  Epsilon-nets and simplex range queries , 1986, SCG '86.

[6]  Tomás Feder,et al.  Optimal algorithms for approximate clustering , 1988, STOC '88.

[7]  G. Pisier.  The volume of convex bodies and Banach space geometry , 1989 .

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

[9]  Emo Welzl,et al.  Smallest enclosing disks (balls and ellipsoids) , 1991, New Results and New Trends in Computer Science.

[10]  Hermann A. Maurer,et al.  New Results and New Trends in Computer Science , 1991, Lecture Notes in Computer Science.

[11]  Micha Sharir,et al.  A subexponential bound for linear programming , 1992, SCG '92.

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

[13]  Vineet Bafna,et al.  Genome rearrangements and sorting by reversals , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

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

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

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

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

[18]  Dana Ron,et al.  Property Testing in Bounded Degree Graphs , 2002, STOC '97.

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

[20]  Marek Karpinski,et al.  On Some Tighter Inapproximability Results, Further Improvements , 1998, Electron. Colloquium Comput. Complex..

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

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

[23]  Pankaj K. Agarwal,et al.  Exact and Approximation Algortihms for Clustering , 1997 .

[24]  Aravind Srinivasan,et al.  Improved bounds and algorithms for hypergraph two-coloring , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[25]  Dana Ron,et al.  A Sublinear Bipartiteness Tester for Bounded Degree Graphs , 1998, STOC '98.

[26]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[27]  Alan M. Frieze,et al.  Clustering in large graphs and matrices , 1999, SODA '99.

[28]  Alberto Caprara,et al.  Sorting Permutations by Reversals and Eulerian Cycle Decompositions , 1999, SIAM J. Discret. Math..

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

[30]  Dana Ron,et al.  Improved Testing Algorithms for Monotonicity , 1999, Electron. Colloquium Comput. Complex..

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

[32]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[33]  Noga Alon,et al.  Regular languages are testable with a constant number of queries , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[34]  Artur Czumaj,et al.  Property Testing in Computational Geometry , 2000, ESA.

[35]  Christian Scheideler,et al.  A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems , 2000, STOC 2000.

[36]  Venkatesan Guruswami,et al.  Hardness of approximate hypergraph coloring , 2000, Electron. Colloquium Comput. Complex..

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

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

[39]  Eldar Fischer,et al.  Large K r -free subgraphs in K s -free graphs and some other Ramsey-type problems , 2005 .

[40]  Christian Scheideler,et al.  Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma , 2000, SODA '00.

[41]  Eldar Fischer,et al.  Testing of matrix properties , 2001, STOC '01.

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

[43]  Artur Czumaj,et al.  Property Testing with Geometric Queries , 2001, ESA.

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

[45]  Jonas Holmerin,et al.  Towards optimal lower bounds for clique and chromatic number , 2003, Theor. Comput. Sci..

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

[47]  Noga Alon,et al.  Testing k-colorability , 2002, SIAM J. Discret. Math..

[48]  Piotr Indyk,et al.  Approximate clustering via core-sets , 2002, STOC '02.

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

[50]  C. SIAMJ..  TESTING MEMBERSHIP IN LANGUAGES THAT HAVE SMALL WIDTH BRANCHING PROGRAMS , 2002 .

[51]  Ronitt Rubinfeld,et al.  Monotonicity testing over general poset domains , 2002, STOC '02.

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

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

[54]  Marek Karpinski,et al.  1.375-Approximation Algorithm for Sorting by Reversals , 2002, ESA.

[55]  Subhash Khot.  Hardness results for approximate hypergraph coloring , 2002, STOC '02.

[56]  Dana Ron,et al.  Testing metric properties , 2003, Inf. Comput..

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

[58]  L. Fortnow,et al.  Quantum property testing , 2002, SODA '03.

[59]  Benny Sudakov,et al.  Approximate coloring of uniform hypergraphs , 1998, J. Algorithms.

[60]  Artur Czumaj,et al.  Sublinear-Time Approximation for Clustering Via Random Sampling , 2004, ICALP.

[61]  E. Fischer.  THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING , 2004 .

[62]  Alan M. Frieze,et al.  Fast monte-carlo algorithms for finding low-rank approximations , 2004, JACM.

[63]  Jirí Sgall,et al.  Functions that have read-twice constant width branching programs are not necessarily testable , 2004, Random Struct. Algorithms.

[64]  Artur Czumaj,et al.  Estimating the weight of metric minimum spanning trees in sublinear-time , 2004, STOC '04.

[65]  Sariel Har-Peled.  Clustering Motion , 2004, Discret. Comput. Geom..

[66]  Bernard Chazelle,et al.  Approximating the Minimum Spanning Tree Weight in Sublinear Time , 2001, ICALP.

[67]  David Sankoff,et al.  Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement , 1995, Algorithmica.