Abstract
This article 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-Free, and k-Dominating Set, are constant-query 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 with a constant number of queries, 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-query tester when k is a constant.
- N. Alon, E. Fischer, I. Newman, and A. Shapira. 2009. A combinatorial characterization of the testable graph properties: It’s all about regularity. SIAM J. Comput. 39 (2009), 143--167. Google Scholar
Digital Library
- Noga Alon, Tali Kaufman, Michael Krivelevich, and Dana Ron. 2008. Testing triangle-freeness in general graphs. SIAM J. Discr. Math. 22, 2 (2008), 786--819. Google Scholar
Digital Library
- Noga Alon and Asaf Shapira. 2008. A characterization of the (natural) graph properties testable with one-sided error. SIAM J. Comput. 37, 6 (2008), 1703--1727. Google Scholar
Digital Library
- Noga Alon and Asaf Shapira. 2008. Every monotone graph property is testable. SIAM J. Comput. 38, 2 (2008), 505--522. Google Scholar
Digital Library
- N. Alon, R. Yuster, and U. Zwick. 1995. Color-coding. J. ACM 42, 4 (1995), 844--856. Google Scholar
Digital Library
- I. Ben-Eliezer, T. Kaufman, M. Krivelevich, and D. Ron. 2008. Comparing the strength of query types in property testing: The case of testing -colorability. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’08). 1213--1222. Google Scholar
Digital Library
- I. Benjamini, O. Schramm, and A. Shapira. 2010. Every minor-closed property of sparse graphs is testable. Adv. Math. 223, 6 (2010), 2200--2218.Google Scholar
Cross Ref
- Leizhen Cai. 2003. Parameterized complexity of vertex colouring. Discr. Appl. Math. 127, 3 (2003), 415--429. Google Scholar
Digital Library
- A. K. Chandra, P. Raghavan, W. L. Ruzzo, R. Smolensky, and P. Tiwari. 1996. The electrical resistance of a graph captures its commute and cover times. Comput. Complex. 6, 4 (1996), 312--340.Google Scholar
Cross Ref
- B. Chazelle, R. Rubinfeld, and L. Trevisan. 2005. Approximating the minimum spanning tree weight in sublinear time. SIAM J. Comput. 34, 6 (2005), 1370--1379. Google Scholar
Digital Library
- Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, and Christian Sohler. 2011. Planar graphs: Random walks and bipartiteness testing. In Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS’11). 423--432. Google Scholar
Digital Library
- R. G. Downey and M. R. Fellows. 1999. Parameterized Complexity. Vol. 3. Springer. Google Scholar
Digital Library
- Oded Goldreich (Ed.). 2010. Property Testing: Current Research and Surveys. LNCS, Vol. 6390. Springer. Google Scholar
Digital Library
- O. Goldreich, S. Goldwasser, and D. Ron. 1998. Property testing and its connection to learning and approximation. J. ACM 45, 4 (1998), 653--750. Google Scholar
Digital Library
- Oded Goldreich and Dana Ron. 2002. Property testing in bounded degree graphs. Algorithmica 32, 2 (2002), 302--343. Google Scholar
Digital Library
- O. Goldreich and D. Ron. 2008. Approximating average parameters of graphs. Random Struct. Algor. 32, 4 (2008), 473--493. Google Scholar
Digital Library
- Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguyen, and Krzysztof Onak. 2009. Local graph partitions for approximation and testing. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS’09). 22--31. Google Scholar
Digital Library
- T. Kaufman, M. Krivelevich, and D. Ron. 2004. Tight bounds for testing bipartiteness in general graphs. SIAM J. Comput. 33, 6 (2004), 1441--1483. Google Scholar
Digital Library
- Reut Levi and Dana Ron. 2015. A quasi-polynomial time partition oracle for graphs with an excluded minor. ACM Trans. Algor. 11, 3 (Jan. 2015), 24--13. Google Scholar
Digital Library
- Ilan Newman and Christian Sohler. 2013. Every property of hyperfinite graphs is testable. SIAM J. Comput. 42, 3 (2013), 1095--1112.Google Scholar
Cross Ref
- H. N. Nguyen and K. Onak. 2008. Constant-time approximation algorithms via local improvements. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS’08). 327--336. Google Scholar
Digital Library
- K. Obata. 2004. Approximate max-integral-flow/min-multicut theorems. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC’04). 539--545. Google Scholar
Digital Library
- K. Onak, D. Ron, M. Rosen, and R. Rubinfeld. 2012. A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size. In Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’12). 1123--1131. Google Scholar
Digital Library
- M. Parnas and D. Ron. 2007. Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms. Theor. Comput. Sci. 381, 1--3 (2007), 183--196. Google Scholar
Digital Library
- Dana Ron. 2010. Algorithmic and analysis techniques in property testing. Found. Trends Theor. Comput. Sci. 5, 2 (2010), 73--205. Google Scholar
Digital Library
- Ronitt Rubinfeld and Asaf Shapira. 2011. Sublinear time algorithms. SIAM J. Discr. Math. 25, 4 (2011), 1562--1588. Google Scholar
Digital Library
- E. Szemerédi. 1978. Regular partitions of graphs. In Proceedings of the International Colloquium of the CNRS. 399--401.Google Scholar
- Yuichi Yoshida and Yusuke Kobayashi. 2012. Testing the (s, t)-disconnectivity of graphs and digraphs. Theoret. Comput. Sci. 435, 25 (2012), 98--113. Google Scholar
Digital Library
- Yuichi Yoshida, Masaki Yamamoto, and Hiro Ito. 2012. Improved constant-time approximation algorithms for maximum matchings and other optimization problems. SIAM J. Comput. 41, 4 (2012), 1074--1093.Google Scholar
Cross Ref
Index Terms
Parameterized Testability
Recommendations
Parameterized testability
ITCS '14: Proceedings of the 5th conference on Innovations in theoretical computer scienceThis 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 ...
Parameterised Algorithms for Deletion to Classes of DAGs
In the Directed Feedback Vertex Set (DFVS) problem, we are given a digraph D on n vertices and a positive integer k, and the objective is to check whether there exists a set of vertices S such that F = D ? S is an acyclic digraph. In a recent paper, ...
On multiway cut parameterized above lower bounds
We introduce a concept of parameterizing a problem above the optimum solution of its natural linear programming relaxation and prove that the node multiway cut problem is fixed-parameter tractable (FPT) in this setting. As a consequence we prove that ...






Comments