Journal of the ACM (JACM)
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Approximate max-integral-flow/min-multicut theorems
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Tight Bounds for Testing Bipartiteness in General Graphs
SIAM Journal on Computing
Approximating the Minimum Spanning Tree Weight in Sublinear Time
SIAM Journal on Computing
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
Theoretical Computer Science
Comparing the strength of query types in property testing: the case of testing k-colorability
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
SIAM Journal on Computing
Approximating average parameters of graphs
Random Structures & Algorithms
Testing Triangle-Freeness in General Graphs
SIAM Journal on Discrete Mathematics
Every Monotone Graph Property Is Testable
SIAM Journal on Computing
Constant-Time Approximation Algorithms via Local Improvements
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
SIAM Journal on Computing
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Local Graph Partitions for Approximation and Testing
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Property testing: current research and surveys
Property testing: current research and surveys
Planar Graphs: Random Walks and Bipartiteness Testing
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Testing the (s,t)-disconnectivity of graphs and digraphs
Theoretical Computer Science
SIAM Journal on Discrete Mathematics
Parameterized Complexity
| Hi-index | 0.00 |
This paper studies property testing for NP optimization problems with parameter k under the general graph model with an augmentation of random edge sampling capability. It is shown that a variety of such problems, including k-Vertex Cover, k-Feedback Vertex Set, k-Multicut, k-path-freeness and k-Dominating Set, are constant-time testable if k is constant. It should be noted that the first four problems are fixed parameter tractable (FPT) and it turns out that algorithmic techniques for their FPT algorithms (branch-and-bound search, color coding, etc.) are also useful for our testers. k-Dominating Set is $W[2]$-hard, but we can still test the property in constant time since the definition of ε-farness makes the problem trivial for non-sparse graphs that are the source of hardness for the original optimization problem. We also consider k-Odd Cycle Transversal, which is another well-known FPT problem, but we only give a sublinear-time tester when k is a constant.