All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables

  • Gregory Gutin
  • Leo van Iersel
  • Matthias Mnich
  • Anders Yeo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6346)

Abstract

A ternary Permutation-CSP is specified by a subset Π of the symmetric group \(\mathcal S_3\). An instance of such a problem consists of a set of variables V and a multiset of constraints, which are ordered triples of distinct variables of V. The objective is to find a linear ordering α of V that maximizes the number of triples whose rearrangement (under α) follows a permutation in Π. We prove that all ternary Permutation-CSPs parameterized above average have kernels with quadratic numbers of variables.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 ; A preliminary version was published in Proc. SODA, pp. 511–517 (2010)
  2. 2.
    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)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Bonami, A.: Étude des coefficients de Fourier des fonctions de L p(G). Ann. Inst. Fourier 20(2), 335–402 (1970)MATHMathSciNetGoogle Scholar
  5. 5.
    Charikar, M., Guruswami, V., Manokaran, R.: Every permutation CSP of arity 3 is approximation resistant. In: Proc. of CCC 2009, pp. 62–73 (2009)Google Scholar
  6. 6.
    Chor, B., Sudan, M.: A geometric approach to betweenness. SIAM J. Discrete Mathematics 11(4), 511–523 (1998)Google Scholar
  7. 7.
    Crowston, R., Gutin, G., Jones, M.: Note on Max Lin-2 above average. Inform. Proc. Lett. 110, 451–454 (2010)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Crowston, R., Gutin, G., Jones, M., Kim, E.J., Ruzsa, I.Z.: Systems of linear equations over \(\mathbb{F}_2\) and problems parameterized above average. To appear in Proc. SWAT 2010 (2010)Google Scholar
  9. 9.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)Google Scholar
  10. 10.
    Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)Google Scholar
  11. 11.
    Galil, Z., Megiddo, N.: Cyclic ordering is NP-complete. Theor. Comput. Sci. 5(2), 179–182 (1977)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Goerdt, A.: On random betweenness constraints. In: Gȩbala, M. (ed.) FCT 2009. LNCS, vol. 5699, pp. 157–168. Springer, Heidelberg (2009)Google Scholar
  13. 13.
    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)Google Scholar
  14. 14.
    Gross, L.: Logarithmic Sobolev inequalities. Amer. J. Math. 97, 1061–1083 (1975)CrossRefMathSciNetGoogle Scholar
  15. 15.
    Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. ACM SIGACT News 38, 31–45 (2007)CrossRefGoogle Scholar
  16. 16.
    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]Google Scholar
  17. 17.
    Gutin, G., Kim, E.J., Lampis, M., Mitsou, V.: Vertex Cover Problem Parameterized Above and Below Tight Bounds. Theory Comput. Syst. (in press)Google Scholar
  18. 18.
    Gutin, G., Kim, E.J., Mnich, M., Yeo, A.: Betweenness Parameterized Above Tight Lower Bound. J. Comput. Sys. Sci. (in press)Google Scholar
  19. 19.
    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); A preliminary version is in Proc. IWPEC 2009. LNCS. 5917, pp. 234–245 (2009)Google Scholar
  20. 20.
    Gutin, G., Rafiey, A., Szeider, S., Yeo, A.: The linear arrangement problem parameterized above guaranteed value. Theory Comput. Syst. 41, 521–538 (2007)MATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Gutin, G., Szeider, S., Yeo, A.: Fixed-parameter complexity of minimum profile problems. Algorithmica 52(2), 133–152 (2008)MATHCrossRefMathSciNetGoogle Scholar
  22. 22.
    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)CrossRefGoogle Scholar
  23. 23.
    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)MATHCrossRefMathSciNetGoogle Scholar
  24. 24.
    Mahajan, M., Raman, V.: Parameterizing above guaranteed values: MaxSat and MaxCut. J. Algorithms 31(2), 335–354 (1999)MATHCrossRefMathSciNetGoogle Scholar
  25. 25.
    Mahajan, M., Raman, V., Sikdar, S.: Parameterizing above or below guaranteed values. J. Comput. Syst. Sci. 75(2), 137–153 (2009)MATHCrossRefMathSciNetGoogle Scholar
  26. 26.
    Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford Univ. Press, Oxford (2006)MATHCrossRefGoogle Scholar
  27. 27.
    Opatrný, J.: Total ordering problem. SIAM J. Comput. 8(1), 111–114 (1979)MATHCrossRefMathSciNetGoogle Scholar
  28. 28.
    Villanger, Y., Heggernes, P., Paul, C., Telle, J.A.: Interval completion is fixed parameter tractable. SIAM J. Comput. 38(5), 2007–2020 (2009)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Gregory Gutin
    • 1
  • Leo van Iersel
    • 2
  • Matthias Mnich
    • 3
  • Anders Yeo
    • 1
  1. 1.Royal HollowayUniversity of LondonUnited Kingdom
  2. 2.University of CanterburyChristchurchNew Zealand
  3. 3.Technische Universiteit EindhovenEindhovenThe Netherlands

Personalised recommendations