1671 search results - page 56 / 335 » On the Covering Steiner Problem |
206
click to vote
APPROX
2008
Springer
15 years 8 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...
180
click to vote
CP
2004
Springer
16 years 4 days ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
187
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— The paper investigates theoretical issues in applying the universal swarming technique to efficient content distribution. In a swarming session, a file is distributed...
160
click to vote
ICDCS
2007
IEEE
16 years 1 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...
200
click to vote
WAOA
2005
Springer
16 years 7 days 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...