270 search results - page 1 / 54 » Partitioning into Sets of Bounded Cardinality |
IWPEC
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We show that the partitions of an n-element set into k members of a given set family can be counted in time O((2− )n ), where > 0 depends only on the maximum size am...
CP
2004
Springer
13 years 10 months ago
2004
Springer
We have started a systematic study of global constraints on set and multiset variables. We consider here disjoint, partition, and intersection constraints in conjunction with cardi...
ARSCOM
2008
13 years 5 months ago
2008
Given a graph G, we say S V (G) is resolving if for each pair of distinct u, v V (G) there is a vertex x in S where d(u, x) = d(v, x). The metric dimension of G is the minimum c...
EOR
2006
13 years 4 months ago
2006
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
HEURISTICS
2008
13 years 3 months ago
2008
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...