<--- Back to Details
First PageDocument Content
NP-complete problems / Parameterized complexity / Kernelization / Dominating set / Vertex cover / Path decomposition / Planar separator theorem / Clique problem / Graph coloring / Theoretical computer science / Graph theory / Mathematics
Date: 2009-10-05 20:16:31
NP-complete problems
Parameterized complexity
Kernelization
Dominating set
Vertex cover
Path decomposition
Planar separator theorem
Clique problem
Graph coloring
Theoretical computer science
Graph theory
Mathematics

Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT Michael R. Fellows School of Electrical Engineering and Computer Science University of Newcastle, University Drive, Callaghan NSW 2308, Australia mfellow

Add to Reading List

Source URL: www.mrfellows.net

Download Document from Source Website

File Size: 121,41 KB

Share Document on Facebook

Similar Documents

Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks Jukka Suomela Helsinki Institute for Information Technology HIIT University of Helsinki, Finland

Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks Jukka Suomela Helsinki Institute for Information Technology HIIT University of Helsinki, Finland

DocID: 1uD6Y - View Document

Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs Marek Karpinski∗ Richard Schmied†

Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs Marek Karpinski∗ Richard Schmied†

DocID: 1uqnU - View Document

Algorithmica DOIs00453Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms Athanassios Koutsonas · Dimitrios M. Thilikos

Algorithmica DOIs00453Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms Athanassios Koutsonas · Dimitrios M. Thilikos

DocID: 1t5yD - View Document

Discrete Applied Mathematics – 245 www.elsevier.com/locate/dam Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover Naomi Nishimuraa,1 , Prabhakar Ragdea,1 , Dimitrios

Discrete Applied Mathematics – 245 www.elsevier.com/locate/dam Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover Naomi Nishimuraa,1 , Prabhakar Ragdea,1 , Dimitrios

DocID: 1t33V - View Document

A simple local 3-approximation algorithm for vertex cover

A simple local 3-approximation algorithm for vertex cover

DocID: 1sHQB - View Document