All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6346 LNCS, Issue PART 1, 2010, Pages 326-337

  Gutin, Gregory ^a   Van Iersel, Leo ^b   Mnich, Matthias ^c   Yeo, Anders ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b UNIVERSITY OF CANTERBURY   (New Zealand)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; LINEAR ORDERINGS; MULTISET; PARAMETERIZED; QUADRATIC NUMBER; SYMMETRIC GROUPS;

EID: 78249260335     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15775-2_28     Document Type: Conference Paper

References (30)

1. Alon, N., Gutin, G., Kim, E.J., Szeider, S., Yeo, A.: Solving MAX-r-SAT above a tight lower bound. Tech. Report arXiv:0907.4573, http://arxiv.org/abs/ 0907.4573 ;
2. A preliminary version was published in Proc. SODA, pp. 511-517 (2010)
3. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423-434 (2009)
4. Bodlaender, H.L., Thomassé, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 635-646. Springer, Heidelberg (2009)
5. p(G). Ann. Inst. Fourier 20(2), 335-402 (1970)
6. Charikar, M., Guruswami, V., Manokaran, R.: Every permutation CSP of arity 3 is approximation resistant. In: Proc. of CCC 2009, pp. 62-73 (2009)
7. Chor, B., Sudan, M.: A geometric approach to betweenness. SIAM J. Discrete Mathematics 11(4), 511-523 (1998)
8. Crowston, R., Gutin, G., Jones, M.: Note on Max Lin-2 above average. Inform. Proc. Lett. 110, 451-454 (2010)
9. Crowston, R., Gutin, G., Jones, M., Kim, E.J., Ruzsa, I.Z.: Systems of linear equations over double-struck F2 and problems parameterized above average. To appear in Proc. SWAT 2010 (2010)
10. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
11. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
12. Galil, Z., Megiddo, N.: Cyclic ordering is NP-complete. Theor. Comput. Sci. 5(2), 179-182 (1977)
13. Goerdt, A.: On random betweenness constraints. In: Gȩbala, M. (ed.) FCT 2009. LNCS, vol. 5699, pp. 157-168. Springer, Heidelberg (2009)
14. Goerdt, A.: On random ordering constraints. In: Frid, A., Morozov, A., Rybalchenko, A., Wagner, K.W. (eds.) CSR 2009. LNCS, vol. 5675, pp. 105-116. Springer, Heidelberg (2009)
15. Gross, L.: Logarithmic Sobolev inequalities. Amer. J. Math. 97, 1061-1083 (1975)
16. Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. ACM SIGACT News 38, 31-45 (2007)
17. Gutin, G., van Iersel, L., Mnich, M., Yeo, A.: All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Kernels with Quadratic Number of Variables. Technical Report arXiv:1004.1956v2 [cs.DS]
18. Gutin, G., Kim, E.J., Lampis, M., Mitsou, V.: Vertex Cover Problem Parameterized Above and Below Tight Bounds. Theory Comput. Syst. (in press)
19. Gutin, G., Kim, E.J., Mnich, M., Yeo, A.: Betweenness Parameterized Above Tight Lower Bound. J. Comput. Sys. Sci. (in press)
20. Gutin, G., Kim, E.J., Szeider, S., Yeo, A.: A probabilistic approach to problems parameterized above or below tight bounds. J. Comput. Sys. Sci. (in press);
21. A preliminary version is in Proc. IWPEC 2009. LNCS. 5917, pp. 234-245 (2009)
22. Gutin, G., Rafiey, A., Szeider, S., Yeo, A.: The linear arrangement problem parameterized above guaranteed value. Theory Comput. Syst. 41, 521-538 (2007)
23. Gutin, G., Szeider, S., Yeo, A.: Fixed-parameter complexity of minimum profile problems. Algorithmica 52(2), 133-152 (2008)
24. Guttmann, W., Maucher, M.: Variations on an ordering theme with constraints. In: Navarro, G., Bertossi, L., Kohayakwa, Y. (eds.) Proc. 4th IFIP International Conference on Theoretical Computer Science-TCS 2006, pp. 77-90. Springer, Heidelberg (2006)
25. Isli, A., Cohn, A.G.: A new approach to cyclic ordering of 2D orientations using ternary relation algebras. Artificial Intelligence 122(1-2), 137-187 (2000)
26. Mahajan, M., Raman, V.: Parameterizing above guaranteed values: MaxSat and MaxCut. J. Algorithms 31(2), 335-354 (1999) (Pubitemid 129610428)
27. Mahajan, M., Raman, V., Sikdar, S.: Parameterizing above or below guaranteed values. J. Comput. Syst. Sci. 75(2), 137-153 (2009)
28. Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford Univ. Press, Oxford (2006)
29. Opatrný, J.: Total ordering problem. SIAM J. Comput. 8(1), 111-114 (1979)
30. Villanger, Y., Heggernes, P., Paul, C., Telle, J.A.: Interval completion is fixed parameter tractable. SIAM J. Comput. 38(5), 2007-2020 (2009)