16404 search results - page 152 / 3281 » A set coverage problem |
122
Voted
NIPS
2004
15 years 4 months ago
2004
Dominant sets are a new graph-theoretic concept that has proven to be relevant in pairwise data clustering problems, such as image segmentation. They generalize the notion of a ma...
144
Voted
CIE
2009
Springer
15 years 10 months ago
2009
Springer
This paper studies the Turing degrees of various properties defined for universal numberings, that is, for numberings which list all partial-recursive functions. In particular pro...
131
click to vote
SWAT
1994
Springer
15 years 7 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
142
Voted
CORR
2002
Springer
15 years 3 months ago
2002
Springer
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
149
Voted
DAM
2011
14 years 10 months ago
2011
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...