A set coverage problem

Authors:
Guo-Qiang Zhang;Licong Cui
Affiliations:
Department of Electrical Engineering and Computer Science, Case Western Reserve University, Cleveland, OH 44106, USA;Department of Electrical Engineering and Computer Science, Case Western Reserve University, Cleveland, OH 44106, USA
Venue:
Information Processing Letters
Year:
2010

Citing 4
Cited 0

Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem

Combinatorics, Probability and Computing
The role mining problem: finding a minimal descriptive set of roles

Proceedings of the 12th ACM symposium on Access control models and technologies
Fast exact and heuristic methods for role minimization problems

Proceedings of the 13th ACM symposium on Access control models and technologies
On covering and rank problems for boolean matrices and their applications

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper shows that with B={1,2,...,n}, the smallest k such that(BxB)-{(j,j)|j@?B}=@?i=1k(C"ixD"i) is s(n), where s(n) is the smallest integer k such that n=