Finding Subsets Maximizing Minimum Structures
نویسندگان
چکیده
منابع مشابه
Interval scheduling maximizing minimum coverage
In the classical interval scheduling type of problems, a set of n jobs, characterized by their start and end time, need to be executed by a set of machines, under various constraints. In this paper we study a new variant in which the jobs need to be assigned to at most k identical machines, such that the minimum number of machines that are busy at the same time is maximized. This is relevant in...
متن کاملMaximizing the Number of Nonnegative Subsets
Given a set of n real numbers, if the sum of the elements of every subset of size larger than k is negative, what is the maximum number of subsets of nonnegative sum? In this note we show that the answer is (n−1 k−1 ) + (n−1 k−2 ) + · · ·+ (n−1 0 ) + 1, settling a problem of Tsukerman. We provide two proofs; the first establishes and applies a weighted version of Hall’s theorem, and the second ...
متن کاملFinding Subsets of Positive Measure
An important theorem of geometric measure theory (first proved by Besicovitch and Davies for Euclidean space) says that every analytic set of non-zero s-dimensional Hausdorff measure Hs contains a closed subset of non-zero (and indeed finite) Hs-measure. We investigate the question how hard it is to find such a set, in terms of the index set complexity, and in terms of the complexity of the par...
متن کاملFinding minimum Tucker submatrices
A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1s on each row are consecutive. These matrices are used for DNA physical mapping and ancestral genome reconstruction in computational biology on the other hand they represents a class of convex bipartite graphs and are of interest of algorithm graph theory researchers. Tucker gave a forb...
متن کاملFinding minimum clique capacity
Let C be a clique of a graph G. The capacity of C is defined to be (|V (G) \ C|+ |D|)/2, where D is the set of vertices in V (G) \C that have both a neighbour and a non-neighbour in C. We give a polynomial-time algorithm to find the minimum clique capacity in a graph G. This problem arose as an open question in a study [1] of packing vertex-disjoint induced three-vertex paths in a graph with no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 1999
ISSN: 0895-4801,1095-7146
DOI: 10.1137/s0895480196309791