1566 search results - page 50 / 314 » On a Cone Covering Problem |
151
click to vote
JGT
2006
15 years 6 months ago
2006
Following [1], we investigate the problem of covering a graph G with induced subgraphs G1, . . . , Gk of possibly smaller chromatic number, but such that for every vertex u of G, ...
167
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
120
click to vote
DAM
2006
15 years 6 months ago
2006
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs--class cove...
134
click to vote
WAOA
2005
Springer
15 years 11 months ago
2005
Springer
In the machine cover problem we are given m machines and n jobs to be assigned (scheduled) so that the smallest load of a machine is as large as possible. A semi-online algorithm i...
179
click to vote
IPL
2010
15 years 25 days ago
2010
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...