Reflections on multivariate algorithmics and problem parameterization

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 5, Issue , 2010, Pages 17-32

  Niedermeier, Rolf ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

Algorithms and complexity; Coping with computational intractability; Fixed parameter tractability; Parameterized algorithmics

Indexed keywords

ALGORITHMICS; ALGORITHMS AND COMPLEXITY; COPING WITH COMPUTATIONAL INTRACTABILITY; FIXED-PARAMETER TRACTABILITY; HARD PROBLEMS; PARAMETER SPACES; PARAMETERIZED COMPLEXITY; SYSTEMATIC INVESTIGATIONS;

COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE;

PARAMETERIZATION;

EID: 84880311245     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2010.2495     Document Type: Conference Paper

References (62)

1. N. Alon, G. Gutin, E. J. Kim, S. Szeider, and A. Yeo. Solving MAX-r-SAT above a tight lower bound. In Proc. 21st SODA. ACM/SIAM, 2010.
2. N. Alon, D. Lokshtanov, and S. Saurabh. Fast FAST. In Proc. 36th ICALP, volume 5555 of LNCS, pages 49-58. Springer, 2009.
3. N. Alon, R. Yuster, and U. Zwick. Color-coding. J. ACM, 42(4):844-856, 1995.
4. E. Althaus, S. Canzar, K. Elbassioni, A. Karrenbauer, and J. Mestre. Approximating the interval constrained coloring problem. In Proc. 11th SWAT, volume 5124 of LNCS, pages 210-221. Springer, 2008.
5. E. Althaus, S. Canzar, M. R. Emmett, A. Karrenbauer, A. G. Marshall, A. Meyer-Baese, and H. Zhang. Computing H/D-exchange speeds of single residues from data of peptic fragments. In Proc. 23rd SAC '08, pages 1273-1277. ACM, 2008.
6. N. Betzler. On problem kernels for possible winner determination under the k-approval protocol. 2009.
7. N. Betzler and B. Dorn. Towards a dichotomy of finding possible winners in elections based on scoring rules. In Proc. 34th MFCS, volume 5734 of LNCS, pages 124-136. Springer, 2009.
8. N. Betzler, M. R. Fellows, J. Guo, R. Niedermeier, and F. A. Rosamond. Fixed-parameter algorithms for Kemeny scores. Theor. Comput. Sci., 410(45):4454-4570, 2009.
9. N. Betzler, J. Guo, C. Komusiewicz, and R. Niedermeier. Average parameterization and partial kernelization for computing medians. In Proc. 9th LATIN, LNCS. Springer, 2010.
10. N. Betzler, S. Hemmann, and R. Niedermeier. A multivariate complexity analysis of determining possible winners given incomplete votes. In Proc. 21st IJCAI, pages 53-58, 2009.
11. H. L. Bodlaender. Kernelization: New upper and lower bound techniques. In Proc. 4th IWPEC, volume 5917 of LNCS, pages 17-37. Springer, 2009.
12. H. L. Bodlaender and A. M. C. A. Koster. Combinatorial optimization on graphs of bounded treewidth. Comp. J., 51(3):255-269, 2008.
13. P. Brass and C. Knauer. Testing the congruence of d-dimensional point sets. Int. J. Comput. Geometry Appl., 12(1-2):115-124, 2002.
14. R. Bredereck. Fixed-parameter algorithms for computing Kemeny scores - theory and practice. Studienarbeit, Institut für Informatik, Friedrich-Schiller-Universität Jena, Germany, 2009.
15. J. Byrka, A. Karrenbauer, and L. Sanità. The interval constrained 3-coloring problem. In Proc. 9th LATIN, LNCS. Springer, 2010.
16. S. Cabello, P. Giannopoulos, and C. Knauer. On the parameterized complexity of d-dimensional point set pattern matching. Inf. Process. Lett., 105(2):73-77, 2008.
17. S. Cabello, P. Giannopoulos, C. Knauer, D. Marx, and G. Rote. Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. ACM Transactions on Algorithms, 2009. To appear. Preliminary version at SODA 2008.
18. L. Cai. Parameterized complexity of vertex colouring. Discrete Appl. Math., 127(1):415-429, 2003.
19. L. Cai, X. Huang, C. Liu, F. A. Rosamond, and Y. Song. Parameterized complexity and biopolymer sequence comparison. Comp. J., 51(3):270-291, 2008.
20. J. Chen, B. Chor, M. Fellows, X. Huang, D. W. Juedes, I. A. Kanj, and G. Xia. Tight lower bounds for certain parameterized NP-hard problems. Inform. and Comput., 201(2):216-231, 2005.
21. J. Chen, I. A. Kanj, and G. Xia. Improved parameterized upper bounds for Vertex Cover. In Proc. 31st MFCS, volume 4162 of LNCS, pages 238-249. Springer, 2006.
22. J. Chen and J. Meng. On parameterized intractability: Hardness and completeness. Comp. J., 51(1):39-59, 2008.
23. V. G. Deiněko, M. Hoffmann, Y. Okamoto, and G. J. Woeginger. The traveling salesman problem with few inner points. Oper. Res. Lett., 34(1):106-110, 2006.
24. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
25. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar. Rank aggregation methods for the Web. In Proc. 10th WWW, pages 613-622, 2001.
26. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar. Rank aggregation revisited, 2001. Manuscript.
27. M. Fellows. Towards fully multivariate algorithmics: Some new results and directions in parameter ecology. In Proc. IWOCA, volume 5874 of LNCS, pages 2-10. Springer, 2009.
28. M. Fellows, D. Lokshtanov, N. Misra, M. Mnich, F. Rosamond, and S. Saurabh. The complexity ecology of parameters: An illustration using bounded max leaf number. Theory Comput. Syst., 45:822-848, 2009.
29. M. R. Fellows, J. Gramm, and R. Niedermeier. On the parameterized intractability of motif search problems. Combinatorica, 26(2):141-167, 2006.
30. M. R. Fellows, D. Lokshtanov, N. Misra, F. A. Rosamond, and S. Saurabh. Graph layout problems parameterized by vertex cover. In Proc. 19th ISAAC, volume 5369 of LNCS, pages 294-305. Springer, 2008.
31. M. R. Fellows, F. A. Rosamond, F. V. Fomin, D. Lokshtanov, S. Saurabh, and Y. Villanger. Local search: Is brute-force avoidable? In Proc. 21st IJCAI, pages 486-491, 2009.
32. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer, 2006.
33. M. Frances and A. Litman. On covering problems of codes. Theory Comput. Syst., 30(2):113-119, 1997.
34. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
35. P. Giannopoulos, C. Knauer, and G. Rote. The parameterized complexity of some geometric problems in unbounded dimension. In Proc. 4th IWPEC, volume 5917 of LNCS, pages 198-209. Springer, 2009.
36. P. Giannopoulos, C. Knauer, and S. Whitesides. Parameterized complexity of geometric problems. Comp. J., 51(3):372-384, 2008.
37. J. Gramm, J. Guo, and R. Niedermeier. Parameterized intractability of distinguishing substring selection. Theory Comput. Syst., 39(4):545-560, 2006.
38. J. Gramm, R. Niedermeier, and P. Rossmanith. Fixed-parameter algorithms for Closest String and related problems. Algorithmica, 37(1):25-42, 2003.
39. J. Guo, F. Hüffner, and R. Niedermeier. A structural view on parameterizing problems: Distance from triviality. In Proc. 1st IWPEC, volume 3162 of LNCS, pages 162-173. Springer, 2004.
40. J. Guo, H. Moser, and R. Niedermeier. Iterative compression for exactly solving NP-hard minimization problems. In Algorithmics of Large and Complex Networks, volume 5515 of LNCS, pages 65-80. Springer, 2009.
41. J. Guo and R. Niedermeier. Invitation to data reduction and problem kernelization. ACM SIGACT News, 38(1):31-45, 2007.
42. P. Hliněný, S. Oum, D. Seese, and G. Gottlob. Width parameters beyond tree-width and their applications. Comp. J., 51(3):326-362, 2008.
43. M. Hoffmann and Y. Okamoto. The minimum weight triangulation problem with few inner points. Comput. Geom., 34(3):149-158, 2006.
44. F. Hüffner, R. Niedermeier, and S. Wernicke. Techniques for practical fixed-parameter algorithms. Comp. J., 51(1):7-25, 2008.
45. S. Khuller, R. Bhatia, and R. Pless. On local search and placement of meters in networks. SIAM J. Comput., 32(2):470-487, 2003.
46. C. Komusiewicz, R. Niedermeier, and J. Uhlmann. Deconstructing intractability - a case study for interval constrained coloring. In Proc. 20th CPM, volume 5577 of LNCS, pages 207-220. Springer, 2009.
47. S. Kratsch and P. Schweitzer. Graph isomorphism parameterized by feedback vertex set number is fixed-parameter tractable. 2009.
48. B. Ma and X. Sun. More efficient algorithms for closest string and substring problems. In Proc. 12th RECOMB, volume 4955 of LNCS, pages 396-409. Springer, 2008.
49. M. Mahajan and V. Raman. Parameterizing above guaranteed values: MaxSat and MaxCut. J. Algorithms, 31(2):335-354, 1999.
50. M. Mahajan, V. Raman, and S. Sikdar. Parameterizing above or below guaranteed values. J. Comput. System Sci., 75(2):137-153, 2009.
51. D. Marx. Parameterized coloring problems on chordal graphs. Theor. Comput. Sci., 351(3):407-424, 2006.
52. D. Marx. Closest substring problems with small distances. SIAM J. Comput., 38(4):1382-1410, 2008.
53. D. Marx. Parameterized complexity and approximation algorithms. Comp. J., 51(1):60-78, 2008.
54. D. Marx. Searching the k-change neighborhood for TSP is W[1]-hard. Oper. Res. Lett., 36(1):31-36, 2008.
55. H. Moser, R. Niedermeier, and M. Sorge. Algorithms and experiments for clique relaxations - finding maximum s-plexes. In Proc. 8th SEA, volume 5526 of LNCS, pages 233-244. Springer, 2009.
56. R. Niedermeier. Ubiquitous parameterization - invitation to fixed-parameter algorithms. In Proc. 29th MFCS, volume 3153 of LNCS, pages 84-103. Springer, 2004.
57. R. Niedermeier. Invitation to Fixed-Parameter Algorithms. Oxford University Press, 2006.
58. B. Reed, K. Smith, and A. Vetta. Finding odd cycle transversals. Oper. Res. Lett., 32(4):299-301, 2004.
59. N. Simjour. Improved parameterized algorithms for the Kemeny aggregation problem. In Proc. 4th IWPEC, volume 5917 of LNCS, pages 312-323. Springer, 2009.
60. C. Sloper and J. A. Telle. An overview of techniques for designing parameterized algorithms. Comp. J., 51(1):122-136, 2008.
61. Y. Song, C. Liu, X. Huang, R. L. Malmberg, Y. Xu, and L. Cai. Efficient parameterized algorithms for biopolymer structure-sequence alignment. IEEE/ACM Trans. Comput. Biology Bioinform., 3(4):423-432, 2006.
62. L. Wang and B. Zhu. Efficient algorithms for the closest string and distinguishing string selection problems. In Proc. 3rd FAW, volume 5598 of LNCS, pages 261-270. Springer, 2009.