16404 search results - page 719 / 3281 » A set coverage problem |
194
Voted
COCOA
2008
Springer
15 years 9 months ago
2008
Springer
The goal of the Cluster Editing problem is to make the fewest changes to the edge set of an input graph such that the resulting graph is a disjoint union of cliques. This problem i...
200
Voted
DLT
2008
15 years 8 months ago
2008
A graph H is computable if there is a graph G = (V, E) isomorphic to H where the set V of vertices and the edge relation E are both computable. In this case G is called a computabl...
200
Voted
FLAIRS
2004
15 years 8 months ago
2004
We consider a novel class of applications where a set of activities conducted by a group of people over a time period needs to be planned, taking into account each member's p...
173
Voted
DIMACS
2001
15 years 8 months ago
2001
We investigate visibility computations with moving viewpoints. The initial problems are of discrete and algorithmic nature, but even for simple classes of objects (such as balls an...
158
click to vote
IPCO
2004
15 years 8 months ago
2004
We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its o...