Abstract combinatorial programs and efficient property testers

SIAM Journal on Computing

Volumn 34, Issue 3, 2005, Pages 580-615

  Czumaj, Artur ^a   Sohler, Christian ^b  

^a New Jersey Institute of Technology   (United States)

^b UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Approximation algorithms; Clustering problems; Coloring; Hereditary graph properties; Property testing; Randomized algorithms

Indexed keywords

APPROXIMATION ALGORITHMS; CLUSTERING PROBLEMS; HEREDITARY GRAPH PROPERTIES; PROPERTY TESTING; RANDOMIZED ALGORITHMS;

ALGORITHMS; COLORING; COMBINATORIAL MATHEMATICS; COMPUTATIONAL GEOMETRY; FUNCTIONS; GRAPH THEORY; PROBABILITY; SET THEORY; THEOREM PROVING;

PROBLEM SOLVING;

EID: 20544434460     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753970444199X     Document Type: Article

References (72)

1. P. K. AGARWAL AND C. M. PROCOPIUC, Exact and approximation algorithms for clustering, Algorithmica, 33 (2002), pp. 201-226.
2. N. ALON, Testing subgraphs in large graphs, Random Structures Algorithms, 21 (2002), pp. 359-370.
3. N. ALON, S. DAR, M. PARNAS, AND D. RON, Testing of cluttering, SIAM J. Discrete Math., 16 (2003), pp. 393-417.
4. N. ALON, E. FISCHER, M. KRIVELEVICH, AND M. SZEGEDY, Efficient testing of large graphs, Combinatorica, 20 (2000), pp. 451-476.
5. N. ALON, W. FERNANDEZ DE LA VEGA, R. KANNAN, AND M. KARPINSKI, Random sampling and approximation of MAX-CSP problems, J. Comput. System Sci., 67 (2003), pp. 212-243.
6. NT ALON, M. KRIVELEVICH, I. NEWMAN, AND M. SZEGEDY, Regular languages are testable with a constant number of gueries, SIAM J. Comput., 30 (2001), pp. 1842-1862.
7. N. ALON AND M. KRIVELEVICH, Testing k-colorability, SIAM J. Discrete Math., 15 (2002), pp. 211-227.
8. N. ALON AND A. SHAPIRA, Testing satisfiability, J. Algorithms, 47 (2003), pp. 87-103.
9. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and hardness of approximation problems, J. ACM, 45 (1998), pp. 501-555.
10. G. AUSIELLO, P. CRESCENZI, G. GAMBOSI, V. KANN, A. MARCHETTI-SPACCAMELA, AND M. PROTASI, Complexity and Approximation. Combinatorial Optimization Problems and Their Approximability Properties, Springer-Verlag, New York, 1998.
11. M. BADOIU, S. HAR-PELED, AND P. INDYK, Approximate clustering via core-sets, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, New York, 2002, pp. 250-257.
12. V. BAFNA AND P. A. PEVZNER, Genome rearrangements and sorting by reversals, SIAM J. Comput., 25 (1996), pp. 272-289.
13. P. BERMAN, S. HANNENHALLI, AND M. KARPINSKI, 1.375-approximation algorithm for sorting by reversals, in Proceedings of the 10th Annual European Symposium on Algorithms (ESA), Lecture Notes in Comput. Sci. 2461, R. H. Möhring and R. Raman, eds., Springer-Verlag, Berlin, 2002, pp. 200-210.
14. P. BERMAN AND M. KARPINSKI, On some tighter inapproximability results, further improvements, in Proceedings of the 26th Annual International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Comput. Sci. 1644, J. Wiedermann, P. van Emde Boas, and M. Nielsen, eds., Springer-Verlag, Berlin, 1999, pp. 200-209.
15. M. BLUM, M. LUBY, AND R. RUBINFELD, Self-testing/correcting with applications to numerical problems, J. Comput. System Sci., 47 (1993), pp. 549-595.
16. B. BOLLOBÁS, Hereditary properties of graphs: Asymptotic enumeration, global structure, and colouring, in Proceedings of the International Congress of Mathematicians, Vol. III, 1998, pp. 333-342.
17. H. BUHRMAN, L. FORTNOW, I. NEWMAN, AND H. RÖHRIG, Quantum property testing, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, Philadelphia, 2003, pp. 480-488.
18. A. CAPRARA, Sorting permutations by reversals and Eulerian cycle decompositions, SIAM J. Discrete Math., 12 (1999), pp. 91-110.
19. B. CHAZELLE, R. RUBINFELD, AND L. TREVISAN, Approximating the minimum spanning tree weight in sublinear time, in Proceedings of the 28th Annual International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Comput. Sci. 2076, F. Orejas, P. G. Spirakis, and J. van Leeuwen, eds., Springer-Verlag, Berlin, 2001, pp. 190-200.
20. A. CZUMAJ, F. ERGÜN, L. FORTNOW, A. MAGEN, I. NEWMAN, R. RUBINFELD, AND C. SOHLER, Sublinear-time approximation of Euclidean minimum spanning tree, in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, Philadelphia, 2003, pp. 813-822.
21. A. CZUMAJ AND C. SCHEIDELER, An algorithmic approach to the general Lovász Local Lemma with applications to scheduling and satisfiability problems, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), ACM Press, New York, 2000, pp. 38-47.
22. A. CZUMAJ AND C. SCHEIDELER, Coloring non-uniform hypergraphs: A new algorithmic approach to the general Lovász Local Lemma, Random Structures Algorithms, 17 (2000), pp. 213-237.
23. A. CZUMAJ AND C. SOHLER, Testing hypergraph coloring, in Proceedings of the 28th Annual International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Comput. Sci. 2076, F. Orejas, P. G. Spirakis, and J. van Leeuwen, eds., Springer-Verlag, Berlin, 2001, pp. 493-505.
24. A. CZUMAJ AND C. SOHLER, Property testing with geometric queries, in Proceedings of the 9th Annual European Symposium on Algorithms (ESA), Lecture Notes in Comput. Sci. 2161, Springer-Verlag, Berlin, 2001, pp. 266-277.
25. A. CZUMAJ AND C. SOHLER, Sublinear-time approximation for clustering via random sampling, in Proceedings of the 31st Annual International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Comput. Sci. 3142, J. Diaz, J. Karhumaki, A. Lepisto, and D. Sannella, eds., Springer-Verlag, Berlin, 2004, pp. 396-407.
26. A. CZUMAJ AND C. SOHLER, Estimating the weight of metric minimum spanning trees in sublinear-time, in Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, New York, 2004, pp. 175-183.
27. A. CZUMAJ, C. SOHLER, AND M. ZIEGLER, Property testing in computational geometry, in Proceedings of the 8th Annual European Symposium on Algorithms (ESA), Lecture Notes in Comput. Sci. 1879, M. Paterson, ed., Springer-Verlag, Berlin, 2000, pp. 155-166.
28. P. DRINEAS, A. FRIEZE, R. KANNAN, S. VEMPALA, AND V. VINAY, Clustering in large graphs and matrices, in Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, Philadelphia, 1999, pp. 291-299.
29. Y. DODIS, O. GOLDREICH, E. LEHMAN, S. RASKHODNIKOVA, D. RON, AND A. SAMORODNITSKY, Improved testing algorithms for monotonicity, in Proceedings of the 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, Lecture Notes in Comput. Sci. 1671, D. Hochbaum, K. Jansen, J. D. P. Rolim, and A. Sinclair, eds., Springer-Verlag, Berlin, 1999, pp. 97-108.
30. P. ERDOS AND L. LOVÁSZ, Problems and results on 3-chromatic hypergraphs and some related questions, in Infinite and Finite Sets (to Paul Erdos on his 60th birthday), A. Hajnal, R. Rado, and V. T. Sós, eds., Vol. II, North-Holland, Amsterdam, 1975, pp. 609-627.
31. L. ENGEBRETSEN AND J. HOLMERIN, Towards optimal lower bounds for clique and chromatic number, Theoret. Comput. Sci., 299 (2003), pp. 537-584.
32. T. FEDER AND D. H. GREENE, Optimal algorithms for approximate clustering, in Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, New York, 1998, pp. 434-444.
33. W. FERNANDEZ DE LA VEGA AND C. KENYON, A randomized approximation scheme for metric Max-Cut, J. Comput. System Sci., 63 (2001), pp. 531-541.
34. E. FISCHER, The art of uninformed decisions. A primer to property testing, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 75 (2001), pp. 97-126.
35. E. FISCHER, Testing graphs for colorability properties, in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, Philadelphia, 2001, pp. 873-882.
36. E. FISCHER, E. LEHMAN, I. NEWMAN, S. RASHKODNIKOVA, R. RUBINFELD, AND A. SAMOROD NITSKY, Monotonicity testing over general poset domains, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, New York, 2002, pp. 474-483.
37. E. FISCHER AND I. NEWMAN, Testing of matrix properties, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), ACM Press, New York, 2001, pp. 286-295.
38. E. FISCHER AND I. NEWMAN, Functions that have read-twice constant width branching programs are not necessarily testable, in Proceedings of the 17th Conference on Computational Complexity, IEEE Computer Society Press, Los Alamitos, CA, 2002, pp. 73-79.
39. A. FRIEZE AND R. KANNAN, The regularity lemma and approximation schemes for dense problems, in Proceedings of the 37th IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, Los Alamitos, CA, 1996, pp. 12-20.
40. A. FRIEZE, R. KANNAN, AND S. VEMPALA, Fast Monte-Carlo algorithms for finding low-rank approximations, in Proceedings of the 39th IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, Los Alamitos, CA, 1998, pp. 370-378.
41. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, New York, 1979.
42. O. GOLDREICH, Combinatorial property testing (a survey), in Proceedings of the DIMACS Workshop on Randomization Methods in Algorithm Design, 1997, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 43, AMS, Providence, RI, 1999, pp. 45-59.
43. O. GOLDREICH, S. GOLDWASSER, AND D. RON, Property testing and its connection to learning and approximation, J. ACM, 45 (1998), pp. 653-750.
44. O. GOLDREICH, S. GOLDWASSER, E. LEHMAN, D. RON, AND A. SAMORODNITSKY, Testing monotonicity, Combinatorica, 20 (2000), pp. 301-337.
45. O. GOLDREICH AND D. RON, Property testing in bounded degree graphs, Algorithmica, 32 (2002), pp. 302-343.
46. O. GOLDREICH AND D. RON, A sublinear bipartiteness tester for bounded degree graphs, Combinatorica, 19 (1999), pp. 335-373.
47. O. GOLDREICH AND L. TREVISAN, Three theorems regarding testing graph properties, Random Structures Algorithms, 23 (2003), pp. 23-57.
48. V. GURUSWAMI, J. HÅSTAD, AND M. SUDAN, Hardness of approximate hypergraph coloring, SIAM J. Comput., 31 (2002), pp. 1663-1686.
49. S. HAR-PELED, Clustering motion, in Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, Los Alamitos, CA, 2001, pp. 84-93.
50. D. HAUSSLER AND E. WELZL, Epsilon-nets and simplex range queries, Discrete Comput. Geom., 2 (1987), pp. 127-151.
51. D. S. HOCHBAUM, ED., Approximation Algorithms for NP-Hard Problems, PWS, Boston, MA, 1996.
52. P. INDYK, Sublinear time algorithms for metric space problems, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, New York, 1998, pp. 428-434.
53. P. INDYK, A sublinear time approximation scheme for clustering in metric spaces, in Proceedings of the 39th IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, Los Alamitos, CA, 1998, pp. 154-159.
54. J. D. KECECIOGLU AND D. SANKOFF, Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement, Algorithmica, 13 (1995), pp. 180-210.
55. S. KHOT, Hardness results for approximate hypergraph coloring, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), ACM Press, New York, 2002, pp. 351-359.
56. Y. KOHAYAKAWA, B. NAGLE, AND V. RöDL, Efficient testing of hypergraphs, in Proceedings of the 29th Annual International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Comput. Sci. 2380, P. Widmayer, F. T. Ruiz, R. Morales, M. Hennessy, S. Eidenbenz, and R. Conejo, eds., Springer-Verlag, Berlin, 2002, pp. 1017-1028.
57. M. KRIVELEVICH AND B. SUDAKOV, Approximate coloring of uniform hypergraphs, J. Algorithms, 49 (2003), pp. 2-12.
58. M. LEWIS AND M. YANNAKAKIS, The node deletion problem for hereditary properties is NP-complete, J. Comput. System Sci., 20 (1980), pp. 219-230.
59. L. LOVÁSZ, Coverings and colorings of hypergraphs, in Proceedings of the 4th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Utilitas Mathematica, Winnipeg, 1973, pp. 3-12.
60. J. MATOUŠEK, M. SHARIR, AND E. WELZL, A subexponential bound for linear programming, Algorithmica, 16 (1996), pp. 498-516.
61. I. NEWMAN, Testing membership in languages that have small width branching programs, SIAM J. Comput., 31 (2002), pp. 1557-1570.
62. M. PARNAS AND D. RON, Testing metric properties, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), ACM Press, New York, 2001, pp. 276-285.
63. P. A. PEVZNER, Computational Molecular Biology, MIT Press, Cambridge, MA, 2000.
64. P. A. PEVZNER AND M. S. WATERMAN, Open combinatorial problems in computational molecular biology, in Proceedings of the 3rd Israel Symposium on Theory of Computing and Systems (ISTCS), IEEE Computer Society Press, Los Alamitos, CA, 1995, pp. 158-173.
65. G. PISIER, The Volume of Convex Bodies and Banach Space Geometry, Cambridge University Press, Cambridge, UK, 1989.
66. J. RADHAKRISHNAN AND A. SRINIVASAN, Improved bounds and algorithms for hypergraph two-coloring, Random Structures Algorithms, 16 (2000), pp. 4-32.
67. R. L. RIVEST AND J. VUILLEMIN, On recognizing graph properties from adjacency matrices, Theoret. Comput. Sci., 3 (1976), pp. 371-384.
68. D. RON, Property testing, in Handbook of Randomized Algorithms, Vol. II, P. M. Pardalos, S. Rajasekaran, J. Reif, and J. D. P. Rolim, eds., Kluwer Academic, Dordrecht, The Netherlands, 2001, pp. 597-649.
69. R. RUBINFELD AND M. SUDAN, Robust characterizations of polynomials with applications to program testing, SIAM J. Comput., 25 (1996), pp. 252-271.
70. M. SUDAN, Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems, Lecture Notes in Comput. Sci. 1001, Springer-Verlag, Heidelberg, 1996.
71. V. N. VAPNIK AND A. Y. CHERVONENKIS, On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl, 16 (1971), pp. 264-280.
72. E. WELZL, Smallest enclosing disks (balls and ellipsoids), in New Results and New Trends in Computer Science, Lecture Notes in Comput. Sci. 555, H. Maurer, ed., Springer-Verlag, Heidelberg, 1991, pp. 359-370.