16404 search results - page 85 / 3281 » A set coverage problem |
TCS
2008
15 years 3 months ago
2008
We exhibit a finite family of functions over a finite set (i.e. a finite algebra) such that the problem whether a given function can be obtained as a composition of the members of ...
117
click to vote
WADS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
127
click to vote
WICON
2008
15 years 4 months ago
2008
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
142
click to vote
JCO
2008
15 years 3 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
108
click to vote
COCOA
2008
Springer
15 years 4 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...