16404 search results - page 450 / 3281 » A set coverage problem |
207
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Given a graph G = (V, E) and a positive integer k, the Proper Interval Completion problem asks whether there exists a set F of at most k pairs of (V × V ) \ E such that the graph...
232
click to vote
DISOPT
2011
14 years 10 months ago
2011
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...
170
click to vote
Publication
Hyper-heuristics are new approaches which aim at raising the level of abstraction when solving combinatorial optimisation problems. In this paper we introduce a new hyper-heuristi...
175
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
154
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
We consider the problem of partitioning n integers chosen randomly between 1 and 2m into two subsets such that the discrepancy, the absolute value of the difference of their sums,...