151 search results - page 11 / 31 » The Minimum Generalized Vertex Cover Problem |
MST
2010
13 years 5 months ago
2010
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
TIT
1998
13 years 7 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
ECML
2006
Springer
13 years 11 months ago
2006
Springer
Minimum volume covering ellipsoid estimation is important in areas such as systems identification, control, video tracking, sensor management, and novelty detection. It is well kno...
ICCNMC
2005
Springer
14 years 27 days ago
2005
Springer
— The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute ...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...