Skip to main content
Springer Nature Link
Log in

Alternate Parameterizations

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 235 Accesses

Years and Authors of Summarized Original Work

  • 2013; Fellows, Jansen, Rosamond

  • 2014; Lokshtanov, Narayanaswamy, Raman, Ramanujan, Saurabh

  • 2014; Marx, Pilipczuk

Problem Definition

A parameterized problem is a language \(L \subseteq \varSigma ^{{\ast}}\times \mathbb{N}\). Such a problem is said to be fixed-parameter tractable if there is an algorithm that decides if (x, k) ∈ L in time f(k) | X | O(1). For attacking an intractable problem within the multivariate algorithmic framework, a necessary first step is to identify some reasonable parameters. The relevance of an FPT algorithm will depend on the quality of the choice of parameters. The first objective is of a practical concern: the choice of parameter should not “cheat,” that is, it should be a choice that leads to tractability in the context of instances that are relevant to real-world applications. On the other hand, the parameter should also lend a perspective that is useful to the algorithm designer, usually by providing...

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Chen J, Kanj IA, Jia W (2001) Vertex cover: further observations and further improvements. J Algorithms 41(2):280–301

    Article  MathSciNet  MATH  Google Scholar 

  2. Courcelle B (1990) The monadic second-order logic of graphs I: recognizable sets of finite graphs. Inf Comput 85:12–75

    Article  MathSciNet  MATH  Google Scholar 

  3. Cygan M, Fomin FV, Kowalik L, Lokshtanov D, Marx D, Pilipczuk M, Pilipczuk M, Saurabh S (2015) Parameterized algorithms. Springer, Cham. http://www.springer.com/us/book/9783319212746

    Book  MATH  Google Scholar 

  4. Fellows MR, Lokshtanov D, Misra N, Rosamond FA, Saurabh S (2008) Graph layout problems parameterized by vertex cover. In: 19th international symposium on algorithms and computation (ISAAC). Lecture notes in computer science, vol 5369. Springer, Berlin, pp 294–305

    Google Scholar 

  5. Fellows M, Lokshtanov D, Misra N, Mnich M, Rosamond F, Saurabh S (2009) The complexity ecology of parameters: an illustration using bounded max leaf number. ACM Trans Comput Syst 45:822–848

    MathSciNet  MATH  Google Scholar 

  6. Fellows MR, Jansen BMP, Rosamond FA (2013) Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity. Eur J Comb 34(3):541–566

    Article  MathSciNet  MATH  Google Scholar 

  7. Ganian R, Hlinený P, Kneis J, Meister D, Obdrzálek J, Rossmanith P, Sikdar S (2010) Are there any good digraph width measures? In: IPEC, vol 6478. Springer, Berlin, pp 135–146

    Google Scholar 

  8. Ganian R, Slivovsky F, Szeider S (2013) Meta-kernelization with structural parameters. In: 38th international symposium on mathematical foundations of computer science, MFCS 2013. Lecture notes in computer science, vol 8087. Springer, Heidelberg, pp 457–468

    Google Scholar 

  9. Gaspers S, Szeider S (2012) Backdoors to satisfaction. In: Bodlaender HL, Downey R, Fomin FV, Marx D (eds) The multivariate algorithmic revolution and beyond. Lecture notes in computer science, vol 7370. Springer, Berlin/Heidelberg, pp 287–317

    Chapter  Google Scholar 

  10. Grohe M, Kreutzer S (2011) Methods for algorithmic meta theorems. In: Grohe M, Makowsky J (eds) Model theoretic methods in finite combinatorics. Contemporary mathematics, vol 558. American Mathematical Society, Providence, pp 181–206

    Chapter  Google Scholar 

  11. Henglein F, Mairson HG (1991) The complexity of type inference for higher-order typed lambda calculi. J Funct Program 4:119–130

    MathSciNet  MATH  Google Scholar 

  12. Lokshtanov D, Narayanaswamy NS, Raman V, Ramanujan MS, Saurabh S (2014) Faster parameterized algorithms using linear programming. ACM Trans Algorithms 11(2):15:1–15:31

    Google Scholar 

  13. Mahajan M, Raman V (1999) Parameterizing above guaranteed values: maxsat and maxcut. J Algorithms 31(2):335–354

    Article  MathSciNet  MATH  Google Scholar 

  14. Marx D, Pilipczuk M (2014) Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask). In: 31st international symposium on theoretical aspects of computer science (STACS), Lyon, pp 542–553

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India

    Neeldhara Misra

Authors
  1. Neeldhara Misra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Neeldhara Misra .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Misra, N. (2016). Alternate Parameterizations. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_786

Download citation

Publish with us

Policies and ethics