1424 search results - page 26 / 285 » The Multi-radius Cover Problem |
108
Voted
CCCG
2001
15 years 2 months 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 ...
127
click to vote
APPROX
2008
Springer
15 years 2 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...
87
Voted
ICDCS
2007
IEEE
15 years 7 months ago
2007
IEEE
We consider a problem that arises during the propagation of subscriptions in a contentbased publish-subscribe system. Subscription covering is a promising optimization that reduce...
117
click to vote
WAOA
2005
Springer
15 years 6 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
FSTTCS
2007
Springer
15 years 6 months ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...