# fixed parameter tractability

Published articles for fixed parameter tractability.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Parameterizing the Vertex Cover Problem

DevFeed: [Parameterizing the Vertex Cover Problem](<https://devfeed.tech/articles/parameterizing-the-vertex-cover-problem-40363.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2014/08/25/parameterizing-the-vertex-cover-problem/>)

Published: 2014-08-25T06:50:11Z

Content type: article

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Algorithms, Complexity](<https://devfeed.tech/topics/algorithms-complexity.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>), [Math and Logic](<https://devfeed.tech/topics/math-and-logic.md>)

Tags: [algorithms](<https://devfeed.tech/tags/algorithms.md>), [complexity](<https://devfeed.tech/tags/complexity.md>), [complexity-theory](<https://devfeed.tech/tags/complexity-theory.md>), [computational-complexity](<https://devfeed.tech/tags/computational-complexity.md>), [conferences](<https://devfeed.tech/tags/conferences.md>), [fixed-parameter-tractability](<https://devfeed.tech/tags/fixed-parameter-tractability.md>), [graph](<https://devfeed.tech/tags/graph.md>), [kernel](<https://devfeed.tech/tags/kernel.md>), [kernelization](<https://devfeed.tech/tags/kernelization.md>), [np-hard](<https://devfeed.tech/tags/np-hard.md>), [vertex-cover](<https://devfeed.tech/tags/vertex-cover.md>)

### AI overview

This article introduces fixed-parameter complexity and explains how fixing a small parameter can make some hard problems tractable. It focuses on kernelization and uses the vertex cover problem as a canonical example, though the supplied text ends before the kernelization method is presented.

### Source excerpt

I'm presenting a paper later this week at the Matheamtical Foundations of Computer Science 2014 in Budapest, Hungary. This conference is an interesting mix of logic and algorithms that aims to bring together researchers from these areas to discuss their work. And right away the first session on the first day focused on an area I know is important but have little experience with: fixed parameter complexity. From what I understand it's not that popular of a topic at major theory conferences in the US (there appears to be only one paper on it at this year's FOCS conference), but the basic ideas are worth knowing.