Advertisement

The Parameterized Complexity of Maximality and Minimality Problems

  • Yijia Chen
  • Jörg Flum
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4169)

Abstract

Many parameterized problems (as the clique problem or the dominating set problem) ask, given an instance and a natural number k as parameter, whether there is a solution of size k. We analyze the relationship between the complexity of such a problem and the corresponding maximality (minimality) problem asking for a solution of size k maximal (minimal) with respect to set inclusion. As our results show maximality problems may increase the parameterized complexity, while “in terms of the W-hierarchy” minimality problems do not increase the complexity.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Arvind, V., Raman, V.: Approximation Algorithms for Some Parameterized Counting Problems. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 453–464. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  2. 2.
    Chang, C.C., Keisler, H.J.: Model Theory. In: Studies in Logic and Mathematical Foundations, vol. 73. North-Holland, Amsterdam (1990)Google Scholar
  3. 3.
    Chen, Y., Flum, J., Grohe, M.: Bounded nondeterminism and alternation in parameterized complexity theory. In: Proceedings of the 18th IEEE Conference on Computational Complexity CCC 2003, pp. 13–29 (2003)Google Scholar
  4. 4.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)Google Scholar
  5. 5.
    Downey, R.G., Fellows, M.R., Regan, K.: Descriptive complexity and the W-hierarchy. In: Proof Complexity and Feasible Arithmetic. AMS-DIMACS Series, vol. 39, pp. 119–134 (1998)Google Scholar
  6. 6.
    Eiter, T., Gottlob, G.: Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing 24(6), 1278–1304 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Fernau, H.: Parameterized algorithms: A graph-theoretic approach. Habilitationsschrift, Universität Tübingen, Tübingen, Germany (2005)Google Scholar
  8. 8.
    Flum, J., Grohe, M.: Fixed-parameter tractability, definability, and model checking. SIAM Journal on Computing 31(1), 113–145 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Flum, J., Grohe, M.: The parameterized complexity of counting problems. SIAM Journal on Computing 33(4), 892–922 (2005)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Flum, J., Grohe, M.: Model-checking problems as a basis for parameterized intractability. Logical Methods in Computer Science 1(1) (2004)Google Scholar
  11. 11.
    Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)Google Scholar
  12. 12.
    Flum, J., Grohe, M., Weyer, M.: Bounded fixed-parameter tractability and \(\mbox{log}^{2}n\) nondeterministic bits. Journal of Computer and System Sciences 72, 34–71 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Khot, S., Raman, V.: Parameterized complexity of finding subgraphs with hereditary properties. Theoretical Computer Science 289(2), 997–1008 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Ritter, C.: Fagin-Definierbarkeit. Diplomarbeit, Universität Freiburg (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yijia Chen
    • 1
  • Jörg Flum
    • 2
  1. 1.BASICS,Department of Computer ScienceShanghai Jiaotong UniversityShanghaiChina
  2. 2.Abteilung für Mathematische Logik, Universität FreiburgFreiburgGermany

Personalised recommendations