16404 search results - page 632 / 3281 » A set coverage problem |
196
click to vote
SIAMCOMP
2002
15 years 6 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
143
click to vote
CSB
2005
IEEE
16 years 23 days ago
2005
IEEE
We study the parsimony approach to haplotype inference, which calls for finding a set of haplotypes of minimum cardinality that explains an input set of genotypes. We prove that ...
147
click to vote
ALDT
2009
Springer
15 years 11 months ago
2009
Springer
We study the problem of allocating a set of indivisible goods to a set of agents having additive preferences. We introduce two new important complexity results concerning efficienc...
174
click to vote
DM
2008
15 years 7 months ago
2008
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...
280
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...