A brief tutorial on fixed-parameter tractability

Here are my notes on fixed-parameter tractability from a recent talk I gave at OSU. They cover some introductory material, such as:

  • The Buss kernel for vertex cover
  • The Nemhauser-Trotter kernel for vertex cover
  • The bounded search tree algorithm for vertex cover.

For more on FPT, see the slides of Daniel Marx (pdf) or the textbook of Cygan et al.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s