Variance in % for rank = 10 0.321232
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 10
1 5 6 7 9 18 78873 39087 108502 110204 39795 127643 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 10
1 5 6 7 9 18 39087 39795 78873 108502 110204 127643 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 10
3782 7188 39087 39795 50948 78873 108502 110204 110565 127643 224935 318852 
Solution for Two pass algorithm (greedy) for rank = 10
9 18 3782 39087 39795 50948 78873 108502 110204 110565 127643 318852 
Variance in % for rank = 10 0.0521877
Variance in % for rank = 10 0.010708
Variance in % for rank = 10 0.0557879
Variance in % for rank = 20 0.198219
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 20
1 2 3 4 5 6 7 9 10 11 12 15 18 21 29 78873 39087 108502 110204 39795 224935 127643 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 20
1 2 3 4 5 6 7 9 10 11 12 15 18 21 29 39087 39795 78873 108502 110204 127643 224935 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 20
3782 7188 18241 39087 39795 44591 48442 50948 67094 78873 95016 99279 108502 110204 110565 127643 179221 224935 303945 318328 318852 333775 
Solution for Two pass algorithm (greedy) for rank = 20
3 9 11 15 18 29 3782 7188 39087 39795 50948 67094 78873 99279 108502 110204 110565 127643 179221 224935 318328 318852 
Variance in % for rank = 20 0.0147395
Variance in % for rank = 20 0.023099
Variance in % for rank = 20 0.0276854
Variance in % for rank = 30 0.153941
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 30
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 21 24 29 30 104 78873 39087 108502 110204 224935 95016 73052 127643 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 30
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 21 24 29 30 104 39087 73052 78873 95016 108502 110204 127643 224935 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 30
3782 7188 18241 39087 39795 41742 44591 48442 50948 58718 67094 73052 73591 78873 89970 95010 95016 99279 108502 110204 110565 125226 127643 129315 179221 204903 224935 303945 318328 318852 333775 
Solution for Two pass algorithm (greedy) for rank = 30
3 8 9 11 13 15 17 18 24 30 3782 7188 18241 39087 39795 44591 48442 50948 67094 78873 95016 99279 108502 110204 110565 127643 179221 224935 318328 318852 333775 
Variance in % for rank = 30 0.0178618
Variance in % for rank = 30 0.0144117
Variance in % for rank = 30 0.0216402
Variance in % for rank = 40 0.155487
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 40
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 24 29 30 32 34 35 36 104 113 1476 78873 39087 108502 110204 39795 110565 224935 318852 67094 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 40
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 24 29 30 32 34 35 36 104 113 1476 39087 39795 50948 78873 108502 110204 110565 224935 318852 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 40
3782 7188 18241 22209 39087 39795 41742 44591 48442 50948 54895 58718 67094 73052 73591 75573 78873 81532 84464 95010 95016 97600 99279 108502 110204 110565 114303 125226 125413 127643 129315 159920 164259 179221 204903 224935 256604 303945 318328 318852 333775 
Solution for Two pass algorithm (greedy) for rank = 40
3 8 9 11 13 15 17 18 20 24 30 34 35 113 1476 3782 7188 18241 39087 39795 41742 44591 48442 50948 67094 73591 78873 89970 95010 95016 99279 108502 110204 110565 129315 179221 224935 303945 318328 318852 333775 
Variance in % for rank = 40 0.00717045
Variance in % for rank = 40 0.00805086
Variance in % for rank = 40 0.0120778
Variance in % for rank = 50 0.155528
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 50
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 29 30 32 34 35 36 52 57 70 74 104 113 236 238 1476 78873 39087 108502 110204 39795 110565 224935 73052 95016 127643 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 50
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 29 30 32 34 35 36 52 57 70 74 104 113 236 238 1476 39087 39795 73052 78873 95016 108502 110204 110565 127643 224935 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 50
3782 7188 12998 14537 18241 22209 26741 39006 39087 39795 41742 43359 44591 48442 50948 54895 58718 67094 73052 73591 75573 78873 81532 84464 89970 95010 95016 97600 99279 104325 108502 110204 110563 110565 114303 125226 125413 127643 129315 130522 159920 160707 164259 179221 204903 224935 256604 303945 318328 318852 333775 
Solution for Two pass algorithm (greedy) for rank = 50
3 8 9 11 13 15 17 18 20 23 24 26 30 34 35 52 74 113 238 1476 3782 7188 18241 39087 39795 41742 44591 48442 50948 58718 67094 73052 73591 78873 89970 95010 95016 99279 108502 110204 110565 125226 127643 129315 179221 204903 224935 303945 318328 318852 333775 
Variance in % for rank = 50 0.01458
Variance in % for rank = 50 0.0226682
Variance in % for rank = 50 0.0136882
Variance in % for rank = 60 0.135413
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 60
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 34 35 36 52 57 59 63 66 70 74 77 81 104 113 236 238 239 1476 1500 78873 39087 108502 110204 39795 110565 224935 318852 73052 95016 127643 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 60
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 34 35 36 52 57 59 63 66 70 74 77 81 104 113 236 238 239 1476 1500 39087 39795 73052 78873 95016 108502 110204 110565 127643 224935 318852 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 60
36 2647 3782 7058 7188 9819 12998 14537 18241 19458 22209 26741 39006 39087 39795 41742 43359 44591 48442 50948 54895 58718 67094 71463 73052 73591 75573 78873 81532 84464 85377 89970 95010 95016 96980 97600 99279 104325 108502 110204 110563 110565 114303 125226 125413 127643 129315 130378 130522 159920 160707 164259 179221 199044 204903 224935 256604 282255 303945 318328 318852 333775 
Solution for Two pass algorithm (greedy) for rank = 60
3 8 9 11 13 15 17 18 20 23 24 26 28 30 34 35 52 59 74 81 113 238 1476 3782 7188 18241 22209 39087 39795 41742 44591 48442 50948 54895 58718 67094 73052 73591 75573 78873 81532 84464 95010 95016 97600 99279 108502 110204 110565 114303 125226 125413 127643 129315 179221 204903 224935 256604 303945 318328 318852 333775 
Variance in % for rank = 60 0.017524
Variance in % for rank = 60 0.026329
Variance in % for rank = 60 0.0212032
Variance in % for rank = 70 0.126902
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 70
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 52 57 59 63 66 68 70 74 75 77 80 81 83 84 104 113 236 238 239 240 420 1476 78873 39087 108502 110204 39795 110565 224935 318852 73052 95016 18241 127643 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 70
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 52 57 59 63 66 68 70 74 75 77 80 81 83 84 104 113 236 238 239 240 420 1476 18241 39087 39795 73052 78873 95016 108502 110204 110565 127643 224935 318852 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 70
36 2647 3718 3782 7058 7188 9819 12998 14537 18241 19415 19458 22209 26741 33359 39006 39087 39795 41742 43359 44460 44591 48442 50948 53807 54895 58718 67094 69332 71463 73052 73591 75573 78873 81532 84464 85377 89970 95010 95016 96980 97600 99279 104325 108502 110204 110563 110565 114303 125226 125413 127643 129315 130378 130522 149633 159920 160707 164259 179221 199044 204903 224935 252801 256604 271709 282255 303945 318328 318852 333775 394046 
Solution for Two pass algorithm (greedy) for rank = 70
3 8 9 11 13 15 17 18 20 23 24 26 28 30 33 34 35 38 52 59 68 74 77 83 84 113 238 240 420 3782 7188 18241 22209 39087 39795 41742 43359 44591 48442 50948 54895 58718 67094 73052 73591 75573 78873 81532 84464 89970 95010 95016 97600 99279 108502 110204 110565 114303 125226 125413 127643 129315 159920 164259 179221 204903 224935 256604 303945 318328 318852 333775 
Variance in % for rank = 70 0.0129886
Variance in % for rank = 70 0.0167409
Variance in % for rank = 70 0.0150021
Variance in % for rank = 80 0.122143
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 80
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 52 57 59 63 66 68 70 74 75 77 80 81 83 84 87 88 90 104 113 236 238 239 240 252 420 1476 1500 78873 39087 108502 110204 39795 110565 224935 318328 318852 73052 95016 18241 127643 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 80
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 52 57 59 63 66 68 70 74 75 77 80 81 83 84 87 88 90 104 113 236 238 239 240 252 420 1476 1500 18241 39087 39795 73052 78873 95016 108502 110204 110565 127643 224935 318328 318852 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 80
36 2647 3718 3782 7058 7188 9819 12998 14285 14537 17783 18241 19415 19458 19755 22209 26741 33359 36265 39006 39087 39795 41742 43359 44460 44591 48442 50948 53807 54895 56751 58718 67094 69332 71463 73052 73591 75573 78873 81532 84464 85377 89970 95010 95016 96980 97600 99279 104325 108502 110204 110563 110565 114303 115265 125226 125413 127643 129315 130378 130522 149633 159920 160184 160707 164259 166305 179221 189947 199044 204903 224935 252801 256604 271709 282255 303945 318328 318852 333775 394046 
Solution for Two pass algorithm (greedy) for rank = 80
3 8 9 11 13 15 17 18 20 23 24 26 28 30 33 34 35 38 40 52 59 68 74 77 83 84 88 113 238 240 420 1500 3782 7188 12998 18241 22209 26741 39087 39795 41742 43359 44591 48442 50948 54895 58718 67094 69332 73052 73591 75573 78873 81532 84464 89970 95010 95016 97600 99279 104325 108502 110204 110565 114303 125226 125413 127643 129315 130522 159920 160707 164259 179221 204903 224935 256604 303945 318328 318852 333775 
Variance in % for rank = 80 0.0121757
Variance in % for rank = 80 0.0151055
Variance in % for rank = 80 0.0135119
Variance in % for rank = 90 0.110402
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 90
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 52 57 59 63 66 68 70 74 75 77 80 81 83 84 87 88 90 92 94 98 101 104 113 236 238 239 240 252 259 271 420 1476 1500 78873 39087 108502 110204 39795 110565 224935 318852 318328 73052 95016 18241 303945 127643 43359 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 90
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 52 57 59 63 66 68 70 74 75 77 80 81 83 84 87 88 90 92 94 98 101 104 113 236 238 239 240 252 259 271 420 1476 1500 7188 18241 39087 39795 43359 73052 78873 95016 108502 110204 110565 127643 224935 318328 318852 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 90
36 1370 2647 3718 3782 7058 7188 8368 9819 12998 14285 14537 17783 18202 18241 19415 19458 19755 22209 26741 29811 33359 36265 39006 39087 39795 41742 43359 43701 44460 44591 48442 50948 53807 54895 56751 58718 67094 69332 71463 73052 73591 75573 78873 81532 82723 84464 85377 89970 95010 95016 96980 97600 99279 104325 108502 110204 110563 110565 114303 115265 125226 125413 127643 129315 130216 130378 130522 131109 137342 149633 159920 160184 160707 164259 166305 178480 179221 189947 199044 204903 213020 224935 252801 256604 271709 282255 303945 318328 318852 333775 394046 
Solution for Two pass algorithm (greedy) for rank = 90
3 8 9 11 13 15 17 18 20 23 24 26 28 30 33 34 35 38 40 42 44 52 59 68 74 77 83 84 88 92 101 113 238 240 259 420 1500 2647 3782 7188 12998 14537 18241 22209 26741 39006 39087 39795 41742 43359 44591 48442 50948 54895 58718 67094 69332 73052 73591 75573 78873 81532 84464 89970 95010 95016 97600 99279 104325 108502 110204 110563 110565 114303 125226 125413 127643 129315 130378 130522 131109 159920 160707 164259 179221 204903 224935 256604 303945 318328 318852 333775 
Variance in % for rank = 90 0.00898462
Variance in % for rank = 90 0.0133391
Variance in % for rank = 90 0.0112246
Variance in % for rank = 100 0.109103
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 100
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 52 57 59 63 66 68 70 74 75 77 80 81 83 84 87 88 90 92 94 96 98 101 102 104 106 110 112 113 236 238 239 240 252 259 271 342 420 1476 1500 1696 78873 39087 108502 110204 39795 224935 318328 73052 95016 18241 70080 204903 127643 43359 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 100
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 52 57 59 63 66 68 70 74 75 77 80 81 83 84 87 88 90 92 94 96 98 101 102 104 106 110 112 113 236 238 239 240 252 259 271 342 420 1476 1500 1696 18241 22209 39087 39795 43359 73052 78873 95016 108502 110204 127643 204903 224935 318328 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 100
36 1370 2647 3718 3782 7058 7188 8368 9819 12998 14285 14537 17783 18202 18241 19415 19458 19755 22209 26741 29811 31541 33359 36265 39006 39087 39795 41742 43359 43608 43701 44460 44591 48442 50948 53807 54895 56751 58718 61950 67094 69332 71463 73044 73052 73591 75573 78873 81532 82723 84464 85377 88531 89970 95010 95016 96980 97600 99279 104325 107236 108502 110204 110563 110565 114303 115265 125226 125413 127643 129315 130216 130378 130522 131109 137342 149633 159920 160184 160707 164259 166305 178480 179221 189947 199044 200158 204903 213020 217880 222860 224935 252801 256604 271709 282255 303945 318328 318852 333775 394046 
Solution for Two pass algorithm (greedy) for rank = 100
3 8 9 11 13 15 17 18 20 23 24 26 28 30 33 34 35 36 38 40 42 44 46 52 59 68 74 77 83 84 88 92 96 101 106 113 238 240 259 342 420 1500 2647 3782 7058 7188 9819 12998 14537 18241 19458 22209 26741 39006 39087 39795 41742 43359 44591 48442 50948 54895 58718 67094 73052 73591 75573 78873 81532 84464 85377 89970 95010 95016 97600 99279 104325 108502 110204 110563 110565 114303 125226 125413 127643 129315 130378 130522 131109 159920 160707 164259 179221 199044 204903 224935 256604 303945 318328 318852 333775 
Variance in % for rank = 100 0.0134072
Variance in % for rank = 100 0.0174043
Variance in % for rank = 100 0.0173591
