1461 search results - page 10 / 293 » Complexity of Graph Covering Problems |
109
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
AICCSA
2007
IEEE
15 years 5 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
CCCG
2001
15 years 17 days ago
2001
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
ADHOCNOW
2008
Springer
15 years 5 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
112
click to vote
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...