MSS   2008 IEEE Symposium on Mass Storage Systems
Wall of Fame | Most Viewed MSS-2008 Paper
118views Hardware» more  MSS 2008»
9 years 7 months ago
Computing the minimal covering set
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset...
Felix Brandt, Felix A. Fischer
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source118
2Download preprint from source112
3Download preprint from source101
4Download preprint from source96
5Download preprint from source96
6Download preprint from source93
7Download preprint from source93
8Download preprint from source89
9Download preprint from source89
10Download preprint from source88
11Download preprint from source88
12Download preprint from source87
13Download preprint from source82
14Download preprint from source80
15Download preprint from source72
16Download preprint from source67
17Download preprint from source67
18Download preprint from source65
19Download preprint from source63
20Download preprint from source61
21Download preprint from source58
22Download preprint from source58