Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

DAM
2008

favoriteEmaildiscussreport

103views more DAM 2008»

Crown reductions for the Minimum Weighted Vertex Cover problem

13 years 4 months ago

Crown reductions for the Minimum Weighted Vertex Cover problem

Download www.maths.sussex.ac.uk

The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown rules: some new directions in FPT, in: Proceedings of the 29th International Workshop on Graph Theoretic Concepts in Computer Science (WG'03), Lecture notes in computer science, vol. 2880, 2003, pp. 1

Miroslav Chlebík, Janka Chlebíkov&aa

Real-time Traffic

DAM 2008 | Minimum Vertex | Reductions | Vertex Cover Problems |

claim paper

Related Content

» Crown Structures for Vertex Cover Kernelization

» An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs

» Vertex Cover in Graphs with Locally Few Colors

» A Local 2Approximation Algorithm for the Vertex Cover Problem

» MinimumWeight Cycle Covers and Their Approximability

» A PrimalDual Approximation Algorithm for Partial Vertex Cover Making Educated Guesses

» On the Inapproximability of Vertex Cover on kPartite kUniform Hypergraphs

» ConstantFactor Approximation for MinimumWeight Connected Dominating Sets in Unit Disk Grap...

» Solving minones2sat as Fast as vertex cover

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DAM
Authors	Miroslav Chlebík, Janka Chlebíková

Comments (0)