Skip to main content
SpringerLink
Log in

Vertex Cover Problem Parameterized Above and Below Tight Bounds

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We study the well-known Vertex Cover problem parameterized above and below tight bounds. We show that two of the parameterizations (both were suggested by Mahajan et al. in J. Comput. Syst. Sci. 75(2):137–153, 2009) are fixed-parameter tractable and two other parameterizations are W[1]-hard (one of them is, in fact, W[2]-hard).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the Vertex Cover problem: theory and experiments. In: Proc. 6th Workshop on Algorithm Engineering and Experiments (ALENEX04), pp. 62–69. ACM/SIAM, New York/Philadelphia (2004)

    Google Scholar 

  2. Abu-Khzam, F.N., Langston, M.A., Shanbhag, P., Symons, C.T.: Scalable parallel algorithms for FPT problems. Algorithmica 45(3), 269–284 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  3. Arvind, V., Raman, V.: Approximation algorithms for some parameterized counting problems. In: Proc. 13th International Symposium on Algorithms and Computation (ISAAC02). Lect. Notes Comput. Sci., vol. 2518, pp. 453–464 (2002)

  4. Cheetham, J., Dehne, F., Rau-Chaplin, A., Stege, U., Taillon, P.J.: Solving large FPT problems on coarse grained parallel machines. J. Comput. Syst. Sci. 67(4), 691–706 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Chen, J., Kanj, I.A., Xia, G.: Simplicity is beauty: improved upper bounds for Vertex Cover. Technical Report 05-008, DePaul University, Chicago (2005)

  6. Damaschke, P.: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theor. Comput. Sci. 351(3), 337–350 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  7. Dom, M., Lokshtanov, D., Saurabh, S., Villanger, Y.: Capacitated domination and covering: a parameterized perspective. In: Proc. IWPEC2008. Lect. Notes Comput. Sci., vol. 5018: pp. 78–90 (2008)

  8. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Berlin (1999)

    Google Scholar 

  9. Esperet, L.: Boxicity of graphs with bounded degree. Eur. J. Comb. 30(5), 1277–1280 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  10. Fellows, M.R.: Towards fully multivariate algorithmics: some new results and directions in parameter ecology. In: Proc. 20th International Workshop on Combinatorial Algorithms (IWOCA09), Lect. Notes Comput. Sci., vol. 5874, pp. 2–10 (2009)

  11. Fernau, H.: On parameterized enumeration. In: Proc. 8th Annual International Computing and Combinatorics Conference (COCOON02). Lect. Notes Comput. Sci., vol. 2383: pp. 564–573 (2002)

  12. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)

    Google Scholar 

  13. Grigorieff, S.: Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time D ⌊log mD ⌋. Theor. Comput. Sci. 356(1), 170–185 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  14. Guo, J., Gramm, J., Hüffner, F., Niedermeier, R., Wernicke, S.: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci. 72(8), 1386–1396 (2006)

    Article  MATH  Google Scholar 

  15. Guo, J., Niedermeier, R., Wernicke, S.: Parameterized complexity of Vertex Cover variants. Theory Comput. Syst. 41(3), 501–520 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  16. Gutin, G., Karapetyan, D., Razgon, I.: FPT algorithms in analysis of heuristics for extracting networks in linear programs. In; Proc. 4th International Workshop on Parameterized and Exact Computation (IWPEC 2009). Lect. Notes Comput. Sci., vol. 5917, pp. 222–233 (2009)

  17. Mahajan, M., Raman, V., Sikdar, S.: Parameterizing above or below guaranteed values. J. Comput. Syst. Sci. 75(2), 137–153 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  18. Mishra, S., Raman, V., Saurabh, S., Sikdar, S., Subramanian, C.R.: The complexity of finding subgraphs whose matching number equals the vertex cover number. In: Proc. ISAAC 2007. Lect. Notes Comput. Sci., vol. 4835, pp. 268–279 (2007)

  19. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, London (2006)

    Book  MATH  Google Scholar 

  20. Niedermeier, R., Rossmanith, P.: A general method to speed up fixed-parameter-tractable algorithms. Inf. Process. Lett. 73, 125–129 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  21. Razgon, I., O’Sullivan, B.: Almost 2-SAT Is Fixed-Parameter Tractable. In: Proc. ICALP2008. Lect. Notes Comput. Sci., vol. 5125, pp. 551–562 (2008)

  22. Reed, B.: χ, Δ and ω. J. Graph Theory 27, 177–212 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  23. West, D.B.: Introduction to Graph Theory. Prentice Hall, New York (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Royal Holloway, University of London, Egham, Surrey, TW20 0EX, UK

    Gregory Gutin & Eun Jung Kim

  2. Department of Computer Science, City University of New York, New York, USA

    Michael Lampis & Valia Mitsou

Authors
  1. Gregory Gutin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eun Jung Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael Lampis
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Valia Mitsou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gregory Gutin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gutin, G., Kim, E.J., Lampis, M. et al. Vertex Cover Problem Parameterized Above and Below Tight Bounds. Theory Comput Syst 48, 402–410 (2011). https://doi.org/10.1007/s00224-010-9262-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-010-9262-y

Keywords

Search

Navigation