Search Sciweavers | Sciweavers

18

WADS
2005
Springer

122views Algorithms» more WADS 2005»

Parameterized Complexity of Generalized Vertex Cover Problems

13 years 11 months ago

Important generalizations of the Vertex Cover problem (Connected Vertex Cover, Capacitated Vertex Cover, and Maximum Partial Vertex Cover) have been intensively studied in terms of...

Jiong Guo, Rolf Niedermeier, Sebastian Wernicke

claim paper

Read More »

11

click to vote

CCCG
2003

132views Computational Geometry» more CCCG 2003»

A combinatorial maximum cover approach to 2D translational geometric covering

13 years 7 months ago

Download www.cccg.ca

Karen Daniels, Arti Mathur, Roger Grinde

claim paper

Read More »

17

click to vote

IWPEC
2010
Springer

209views Applied Computing» more IWPEC 2010»

Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier

13 years 4 months ago

Download www.cmi.ac.in

M. Praveen

claim paper

Read More »

30

click to vote

ACID
2006

220views Algorithms» more ACID 2006»

Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms

13 years 7 months ago

Download www.dcs.gla.ac.uk

We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...

Henning Fernau, David Manlove

claim paper

Read More »

16

click to vote

BIRTHDAY
2009
Springer

106views Applied Computing» more BIRTHDAY 2009»

Covering a Tree by a Forest

14 years 26 days ago

Download www.cs.technion.ac.il

Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...

Fanica Gavril, Alon Itai

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers