Parameterized complexity and approximation algorithms

Computer Journal

Volumn 51, Issue 1, 2008, Pages 60-78

  Marx, Dániel ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Approximation algorithms; Parameterized complexity

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS;

HARD ALGORITHMIC PROBLEM; PARAMETERIZED COMPLEXITY;

ALGORITHMS;

EID: 38349157286     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxm048     Document Type: Article

References (116)

1. Demaine, E.D., Hajiaghayi, M. and Kawarabayashi, K. (2005) Algorithmic graph minor theory: Decomposition, approximation, and coloring. Proc. 46th Annual IEEE Symp. Foundations of Computer Science (FOCS 2005), Pittsburgh, PA, October 23-25, pp. 637-646.
2. Flum, J. and Grohe, M. (2006) Parameterized Complexity Theory. Springer-Verlag, Berlin.
3. Downey, R.G. and Fellows, MR. (1999) Parameterized complexity. In Monographs in Computer Science. Springer-Verlag, New York.
4. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A. and Protasi, M. (1999) Complexity and Approximation Springer-Verlag, Berlin.
5. Håstad, J. (2001) Some optimal inapproximability results. J. ACM 48, 798-859.
6. Böckenhauer, H.-J., Hromkovič, J., Kneis, J. and Kupke, J. (2006) On the parameterized approximability of TSP with deadlines. Theory Comput. Syst., To appear.
7. Har-Peled, S. and Mazumdar, S. (2004) On coresets for k-means and k-median clustering. Proc. 36th Annual ACM Symp. Theory of Computing, Chicaco, IL, pp. 291-300. ACM, New York.
8. Christofides, N. (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh.
9. Papadimitriou, C. H. and Yannakakis, M. (1993) The traveling salesman problem with distances one and two. Math. Oper. Res., 18, 1-11.
10. Chen, J., Kanj, I.A. and Jia, W. (2001) Vertex cover: Further observations and further improvements. J. Algorithms, 41, 280-301.
11. Sunil Chandran, L. and Grandom, F. (2005) Refined memorization for vertex cover. Inf. Process. Lett., 93, 125-131.
12. Khot, S. and Regev, O. (2003) Vertex cover might be hard to approximate to within 2 - ε. Proc. 18th Annual IEEE Conference on Computational Complexity (CCC'03), pp. 397-386.
13. Guo, J., Niedermeier, R. and Wernicke, S. (2005) Parameterized complexity of generalized vertex cover problems. Proc. 9th Workshop on Algorithms and Data Structures (WADS'05), Lecture Note Series in Computer Science, Vol. 3608, pp. 36-48. Springer-Verlag, Berlin.
14. Hochbaum, D.S. and Pathria, A. (1998) Analysis of the greedy approach in covering problems. Nav. Res. Q., 45, 615-627.
15. Petrank, E. (1994) The hardness of approximation: Gap location. Comput. Complexity, 4, 133-157.
16. Alon, N., Yuster, R. and Zwick, U. (1997) Finding and counting given length cycles. Algorithmica, 17, 209-223.
17. Gonzalez, T.F. (1985) Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci., 38, 293-306.
18. Marx, D. (2005) Efficient approximation schemes for geometric problems? Proc. 13th Annual European Symp. Algorithms (ESA 2005), Lecture Notes in Computer Science, Vol. 3669, pp. 448-459. Springer, Berlin.
19. Agarwal, P.K. and Procopiuc, C.M. (2002) Exact and approximation algorithms for clustering. Algorithmica, 33, 201-226.
20. Trevisan, L. (2000) When Hamming meets Euclid: The approximability of geometric TSP and Steiner tree. SIAM J. Comput., 30, 475-485.
21. Cabello, S., Giannopoulos, P. and Knauer, C. (2006) On the parameterized complexity of d-dimensional point set pattern matching. Proc. Int. Workshop on Parameterized and Exact Computation (IWPEC 2006), Lecture Notes in Computer Science, Vol. 4169, pp. 175-183.
22. Bodlaender, H.L. (1993) A tourist guide through treewidth. Acta Cybern., 11, 1-21.
23. Diestel, R. (2005) Graph Theory. Graduate Texts in Mathematics, (3rd edn), Springer-Verlag, Berlin.
24. Cai, L. (2003) Parameterized complexity of vertex colouring. Discret. Appl. Math., 127, 415-429.
25. Guo, J., Hüffner F. and Niedermeier, R. (2004) A structural view on parameterizing problems: Distance from triviality. Proc. Int. Workshop on Parameterized and Exact Computation (IWPEC 2006), Lecture Notes in Computer Science, Vol. 3162, pp. 162-173. Springer, Berlin.
26. Marx, D. (2006) Parameterized coloring problems on chordal graphs. Theoret. Comput. Sci., 351, 407-424.
27. Feige, U. and Kilian, J. (1998) Zero knowledge and the chromatic number. J. Comput. Syst. Sci., 57, 187-199.
28. Stockmeyer, L. (1973) Planar 3-colorability is NP-complete. SIGACT News, 5: 19-25.
29. Appel, K. and Haken, W. (1989) Every Planar Map is Four Colorable. Contemporary Mathematics, Vol. 98 (American Mathematical Society, Providence, RI), (With the collaboration of J. Koch).
30. Robertson, N., Sanders, D.P., Seymour, P. and Thomas, R. (1996) Efficiently four-coloring planar graphs. Proc. Twenty-eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, PA, 1996, pp. 571-575. ACM, New York.
31. Marx, D. and Schlotter, I. (2007) Obtaining a planar graph by vertex deletion. To appear in WG'07.
32. Lichtenstein, D. (1982) Planar formulae and their uses. SIAM J. Comput., 11, 329-343.
33. Lipton, R. J. and Tarjan, R.E. (1980) Applications of a planar separator theorem. SIAM J. Comput., 9, 615-627.
34. Baker, B.S. (1994) Approximation algorithms for NP-complete problems on planar graphs. J. Assoc. Comput. Mach., 41, 153-180.
35. Grohe, M. (2003) Local tree-width, excluded minors, and approximation algorithms. Combinatorica, 23, 613-632.
36. Demaine, E.D. and Hajiaghayi, M. (2004) Equivalence of local treewidth and linear local treewidth and its algorithmic applications. Proc. 15th Annual ACM-SIAM Symp. Discrete Algorithms (SODA 2004), New Orleans, LA, January 11-13, pp. 833-842.
37. Bar-Noy, A., Halldórsson, M.M., Kortsarz, G., Salman, R. and Shachnai, H. (2000) Sum multicoloring of graphs. J. Algorithms, 37, 422-450.
38. Nicoloso, S., Sarrafzadeh, M. and Song, X. (1999) On the sum coloring problem on interval graphs. Algorithmica, 23, 109-126.
39. Jansen, K. (1997) The optimum cost chromatic partition problem. Proc. Algorithms and complexity, Rome, Lecture Notes in Computer Science, Vol. 1203, pp. 25-36. Springer, Berlin.
40. Giaro, K. and Kubale, M. (2000) Edge-chromatic sum of trees and bounded cyclicity graphs. Inf. Process. Lett., 75, 65-69.
41. Salavatipour, M.R. (2003) On sum coloring of graphs. Discret. Appl. Math., 127, 477-488.
42. Marx, D. (2004) Complexity results for minimum sum edge coloring. Manuscript.
43. Marx, D. (2005) Minimum sum multicoloring on the edges of planar graphs and partial k-trees. Proc. 2nd Int. Workshop on Approximation and Online Algorithms (WAOA 2004), Lecture Notes in Computer Science, Vol. 3351, pp. 9-22. Springer, Berlin.
44. Cai, L. and Huang, X. (2006) Fixed-parameter approximation: Conceptual framework and approximability results. Proc. Int. Workshop on Parameterized and Exact Computation (IWPEC 2006), Vol. 4169, Lecture Notes in Computer Science, pp. 96-108.
45. Chen, Y., Grohe, M. and Grüber, M. (2006) On parameterized approximability. Proc. Int. Workshop on Parameterized and Exact Computation (IWPEC 2006), Lecture Notes in Computer Science, Vol. 4169, pp. 109-120.
46. Downey, R., Fellows, M. and McCartin, C. (2006) Parameterized approximation algorithms. Proc. Int. Workshop on Parameterized and Exact Computation (IWPEC 2006), Lecture Notes in Computer Science, Vol. 4169, pp. 121-129.
47. Bodlaender, H.L. (1996) A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25, 1305-1317.
48. Robertson, N. and Seymour, P.D. (1995) Graph minors. XIII. The disjoint paths problem. J. Comb. Theory Ser. B, 63, 65-110.
49. Reed, B.A. (1992) Finding approximate separators and computing tree width quickly. STOC'92: Proc. Twenty-fourth Annual ACM Symp. Theory of Computing, New York, NY, USA, pp. 221-228. ACM Press.
50. Reed, B.A. (1997) Tree width and tangles: A new connectivity measure and some applications. Surveys in combinatorics, 1997 (London), London Mathematical Society Lecture Note Series, Vol. 241, pp. 87-162. Cambridge Univ. Press, Cambridge.
51. Amir, E. (2001) Efficient approximation for triangulation of minimum treewidth. In UAI '01: Proc. 17th Conf. Uncertainty in Artificial Intelligence, San Francisco, CA, USA, pp. 7-15. Morgan Kaufmann Publishers Inc.
52. Courcelle, B. and Oum, S.-I. (2007) Vertex-minors, monadic second-order logic, and a conjecture by Seese. J. Comb. Theory Ser. B, 97 91-126.
53. Hliněný, P. (2005) A parametrized algorithm for matroid branch-width. SIAM J. Comput., 35, 259-277.
54. Oum, S.-I. and Seymour, P. (2006) Approximating cliquewidth and branch-width. J. Comb. Theory Ser. B, 96, 514-528.
55. Oum, S.-I. (2005) Approximating rank-width and cliquewidth quickly. Proc. 31st Int. Workshop on Graph-Theoretic Concepts in Computer Science pp. 49-58.
56. Grohe, M. and Grüber, M. (2007) Parameterized approximability of the disjoint cycle problem, ICALP '07, To appear.
57. Bodlaender, H.L., Gilbert, J.R., Hafsteinsson, H. and Kloks, T. (1995) Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. J. Algorithms, 18, 238-255.
58. Feige, U., Hajiaghayi, M.T. and Lee, J.R. (2005) Improved approximation algorithms for minimum-weight vertex separators. STOC'05: Proc. 37th Annual ACM Symp. Theory of Computing, pp. 563-572. ACM, New York.
59. Bouchitté, V., Kratsch, D., Müller, H. and Todinca, I. (2004 On treewidth approximations. Discret. Appl. Math., 136, 183-196; The lst Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2001).
60. 3) FPT algorithm for the undirected feedback vertex set problem. Proc. Computing and Combinatorics, Lecture Notes in Computer Science, Vol. 3595, pp. 859-869. Springer, Berlin.
61. Even, G., Naor, J., Schieber, B. and Sudan, M. (1998) Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20, 151-174.
62. Seymour, P.D. (1995) Packing directed circuits fractionally. Combinatorica, 15, 281-288.
63. Slivkins, A. (2003) Parameterized tractability of edge-disjoint paths on directed acyclic graphs. Proc. Algorithms - ESA 2003, 11th Annual Eur. Symp. Lecture Notes in Computer Science, Vol. 2832, pp. 482-493. Springer, Berlin.
64. Reed, B., Robertson, N., Seymour P. and Thomas, R. (1996) Packing directed circuits. Combinatorica, 16, 535-554.
65. Díaz, J., Petit, J. and Serna, M. (2002) A survey of graph layout problems. ACM Comput. Surv., 34, 313-356.
66. Bodlaender, H.L., Fellows, M.R. and Hallett, M.T. (1994) Beyond NP-completeness for problems of bounded width (extended abstract): hardness for the W hierarchy. In STOC '94: Proc. Twenty-sixth Annual ACM Symp. Theory of computing, New York, NY, USA, pp. 449-458. ACM Press.
67. Thilikos, D.M., Serna, M.J. and Bodlaender, H.L. (2000) Constructive linear time algorithms for small cutwidth and carving-width. Proc. Algorithms and Computation, Taipei, Lecture Notes in Computer Science, Vol. 1969, pp. 192-203. Springer, Berlin.
68. Bodlaender, ILL. Unpublished result.
69. Fellows, M.R. Unpublished result.
70. Courcelle, B., Engelfriet, J. and Rozenberg, G. (1991) Contextfree handle-rewriting hypergraph grammars. Graph Grammars and Their Application to Computer Science (Bremen, 1990), Lecture Notes in Computer Science, Vol. 532, pp. 253-268. Springer, Berlin.
71. Fellows, M.R., Rosamond, F.A., Rotics, U. and Szeider, S. (2006) Clique-width minimization is NP-hard. Proc. 38th Annual ACM Sym. Theory of Computing, Seattle, WA, USA, pp. 354-362. ACM press.
72. Downey, R.G. (2003) Parameterized complexity for the skeptic. Proc. 18th IEEE Annual Conf. Computational Complexity, pp. 147-169.
73. Arora, S. (1996) Polynomial time approximation schemes for Euclidean TSP and other geometric problems. Proc. 39th Annual Symp. Foundations of Computer Science, pp. 2-11. IEEE Comput. Soc. Press.
74. Arora, S. (1998) Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM, 45, 753-782.
75. Arora, S., Raghavan, P. and Rao, S. (1999) Approximation schemes for Euclidean k-medians and related problems. In STOC '98, Dallas, TX, pp. 106-113. ACM, New York.
76. Hunt, III, H.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J. and Stearns, R.E. (1998) NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. J. Algorithms, 26, 238-274.
77. Bazgan, C. (1995) Schémas d'approximation et complexité paramétrée. Technical report, Université Paris Sud.
78. Cesati, M. and Trevisan, L. (1997) On the efficiency of polynomial time approximation schemes. Inf. Process. Lett., 64, 165-171.
79. Wang, D.W. and Kuo, Y.-S. (1988) A study on two geometric location problems. Inf. Process. Lett., 28, 281-286.
80. Malesińska, E. (1997) Graph-theoretical models for frequency assignment problems. PhD Thesis, Technical University of Berlin.
81. Agarwal, P.K., van Kreveld, M. and Suri, S. (1998) Label placement by maximum independent set in rectangles. Comput. Geom., 11, 209-218.
82. Nieberg, T. and Hurink, J. (2006) A PTAS for the minimum dominating set problem in unit disk graphs. Proc. 3rd Int. Workshop on Approximation and Online Algorithms (WAOA 2005), Lecture Notes in Computer Science, Vol. 3879, pp. 296-306. Springer, Berlin.
83. Nieberg, T., Hurink, J. and Kern, W. (2003) New PTAS for the independent set problem in unit disk graphs. Memorandum no. 1688, Department of Applied Mathematics, Universiteit Twente.
84. Marx, D. (2006) Parameterized complexity of independence and domination on geometric graphs. Proc. Int. Workshop on Parameterized and Exact Computation (IWPEC 2006), Lecture Notes in Computer Science, Vol. 4169, pp. 154-165.
85. Li, M., Ma, B. and Wang, L. (2002) On the closest string and substring problems. J. ACM, 49, 157-171.
86. Gramm, J., Niedermeier, R. and Rossmanith, P. (2003) Fixedparameter algorithms for closest string and related problems. Algorithmica, 37, 25-42.
87. Gramm, J., Niedermeier, R. and Rossmanith, P. (2001) Exact solutions for closest string and related problems. ISAAC '01: Proc. 12th Int. Symp. Algorithms and Computation, Lecture Notes in Computer Science, Vol. 2223, pp. 441-453. Springer, Berlin.
88. Marx, D. (2005) The closest substring problem with small distances. Proc. 46th Annual IEEE Symp. Foundations of Computer Science (FOCS'05 Pittsburgh, PA, pp. 63-72.
89. Fellows, M.R. Gramm J. and Niedermeier, R. (2006) On the parameterized intractability of motif search problems. Combinatorica, 26, 141-167.
90. Khanna, S., Sudan, M., Trevisan, L. and Williamson, D.P. (2001) The approximability of constraint satisfaction problems. SIAM J. Comput. 30, 1863-1920.
91. Khanna, S. and Motwani, R. (1996) Towards a syntactic characterization of PTAS. Proc. Twenty-eighth Annual ACM Symp. the Theory of Computing Philadelphia, PA, 1996, pp. 329-337. ACM, New York.
92. Cai, L., Fellows, M., Juedes, D. and Rosamond, F. (2006) The complexity of polynomial-time approximation. Theory Comput. Syst., To appear.
93. Chen, J., Huang, X., Kanj, I.A. and Xia, G. (2004) Linear FPT reductions and computational lower bounds. Proc. 36th Annual ACM Symp. Theory of Computing, Chicago, EL, pp. 212-221. ACM, New York.
94. Rolf, D. (2005) Improved bound for the PPSZ/Schöning-algorithm for 3-SAT. Technical report TR05-159, Electronic Colloq. on Computational Complexity.
95. Impagliazzo, R., Paturi, R. and Zane, F. (2001) Which problems have strongly exponential complexity? J. Comput. Syst. Sci., 63, 512-530. Special issue on FOCS 98 (Palo Alto, CA).
96. Downey, R., Estivill-Castro, V., Fellows, M., Prieto, E. and Rosamund, F. (2003) Cutting up is hard to do. In Harland, J. (ed.), Electronic Notes in Theoretical Computer Science, Vol. 78. Elsevier.
97. Demaine, E.D. and Hajiaghayi, M. (2004) Fast algorithms for hard graph problems: Bidimensionality, minors, and local treewidth. Proc. 12th Int. Symp. Graph Drawing (GD 2004), Lecture Notes in Computer Science, Vol. 3383, Harlem, New York, September 29-October 2, pp. 517-533.
98. Demaine, E.D., Fomin, F.V., Hajiaghayi, M. and Thilikos, D.M. (2005) Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs. J. ACM, 52, 866-893.
99. Nemhauser, G.L. and Trotter, Jr, L.E. (1975) Vertex packings: Structural properties and algorithms. Math. Program., 8, 232-248.
100. Chen, J., Fernau, H., Kanj, I.A. and Xia, G. (2005) Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. STACS 2005, Lecture Notes in Computer Science, Vol. 3404, pp. 269-280. Springer, Berlin.
101. Reed, B., Smith, K. and Vetta, A. (2004) Finding odd cycle transversals. Oper. Res. Lett., 32, 299-301.
102. Marx, D. (2006) Chordal deletion is fixed-parameter tractable. In Graph-theoretic concepts in computer science (WG 2006), Lecture Notes in Computer Science, Vol. 4271, pp. 37-48.
103. Guo, J., Gramm, J., Hüffner, F., Niedermeier, R. and Wernicke, S. (2005) Improved fixed-parameter algorithms for two feedback set problems. Proc. 9th Workshop on Algorithms and Data Structures (WADS'05), Lecture Note Series in Computer Science, Vol. 3608, pp. 158-168. Springer-Verlag, Berlin.
104. Guo, J., Gramm, J., Hüffner, F., Niedermeier, R. and Wernicke, S. (2006) Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci., 72, 1386-1396.
105. Valiant, L.G. (1979) The complexity of computing the permanent. Theoret. Comput. Sci., 8, 189-201.
106. Monien, B. (1985) How to find long paths efficiently. Proc Analysis and design of algorithms for combinatorial problems (Udine, 1982), North-Holland Mathamatical Studies, Vol. 109, pp. 239-254. North-Holland, Amsterdam.
107. Plehn, J. and Voigt, B. (1991) Finding minimally weighted subgraphs. Proc. Graph-theoretic concepts in computer science (Berlin, 1990), Lecture Notes in Computer Science, Vol. 484, pp. 18-29. Springer, Berlin.
108. Flum, J. and Grohe, M. (2004) The parameterized complexity of counting problems. SIAM J. Comput., 33, 892-922.
109. Arvind, V. and Raman, V. (2002) Approximation algorithms for some parameterized counting problems. In ISAAC '02: Proc. 13th Int. Symp. Algorithms and Computation, Lecture Notes in Computer Science, Vol. 2518, pp. 453-464. Springer, Berlin.
110. Müller, M. (2006) Randomized approximations of parameterized counting problems. Proc. Int. Workshop on Parameterized and Exact Computation (IWPEC 2006), Lecture Notes in Computer Science, Vol. 4169, pp. 50-59.
111. Chekuri, C. and Khanna, S. (2000) A PTAS for the multiple knapsack problem. Proc. Eleventh Annual ACM-SIAM Symp. Discrete Algorithms, San Francisco, CA, 2000, pp. 213-222. ACM, New York.
112. Shamir, R. and Tsur, D. (1998) The maximum subforest problem: approximation and exact algorithms (extended abstract). Proc. Ninth Annual ACM-SIAM Symp. Discrete Algorithms, San Francisco, CA, pp. 394-399. ACM, New York.
113. Erlebach, T., Jansen, K. and Seidel, E. (2005) Polynomial-time approximation schemes for geometric intersection graphs. SIAM J. Comput., 34, 1302-1323.
114. Hochbaum, D.S. and Maass, W. (1985) Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM, 32 130-136.
115. Deng, X., Li, G., Li, Z., Ma, B. and Wang, L. (2002) A PTAS for distinguishing (sub)string selection. ICALP 02: Proc. 29th Int. Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 2380, pp. 740-751. Springer, Berlin.
116. Gramm, J., Guo, J. and Niedermeier, R. (2003) On exact and approximation algorithms for distinguishing substring selection. Proc. Fundamentals of Computation Theory, Lecture Notes in Computer Science, Vol. 2751, pp. 195-209. Springer, Berlin.