Variance in % for rank = 10 0.0936196
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 10
4 14 2905 2670 1218 3916 3508 3159 3554 1663 3512 3928 3864 314 3932 3022 2821 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 10
4 14 73 260 527 919 1301 1663 2070 2501 2762 2905 3159 3629 3916 3928 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 10
73 527 593 955 1301 1348 2070 2501 2762 2788 2821 2905 3114 3159 3844 3916 3928 
Solution for Two pass algorithm (greedy) for rank = 10
73 527 593 955 1301 1348 2070 2501 2762 2788 2821 2905 3114 3159 3844 3916 3928 
Variance in % for rank = 10 0.0307705
Variance in % for rank = 10 0.0410939
Variance in % for rank = 10 0.0298599
Variance in % for rank = 20 0.0771764
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 20
3 4 5 7 9 14 16 26 27 152 2028 260 527 2762 318 1193 593 1301 1097 2070 1961 1294 1947 909 2804 919 913 3629 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 20
3 4 5 7 9 14 16 26 27 152 919 1035 1193 1198 1269 1292 1301 1302 1663 1925 1947 2028 2501 2670 2762 2804 3159 3309 3916 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 20
150 318 527 593 858 919 1023 1042 1198 1265 1301 1302 1348 1721 1873 2028 2070 2324 2762 2788 2905 3035 3114 3147 3512 3844 3916 3928 
Solution for Two pass algorithm (greedy) for rank = 20
5 150 318 527 593 919 1023 1198 1301 1302 1348 1721 1873 2028 2070 2150 2324 2762 2788 2905 3035 3114 3147 3512 3844 3916 3928 
Variance in % for rank = 20 0.026893
Variance in % for rank = 20 0.0314629
Variance in % for rank = 20 0.0356812
Variance in % for rank = 30 0.0692006
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 30
3 4 5 7 9 12 14 16 19 26 27 30 31 152 2028 527 260 1198 2762 318 593 1193 858 2571 3916 1097 3578 1961 2070 1301 1240 2804 1947 919 1294 909 913 3088 3629 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 30
3 4 5 7 9 12 14 16 19 26 27 30 31 150 152 260 318 919 1035 1097 1196 1198 1269 1270 1292 1301 1302 1663 1925 1947 2028 2501 2670 2762 2804 3114 3159 3916 3928 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 30
150 260 318 527 539 593 919 1023 1097 1193 1198 1265 1269 1301 1302 1348 1721 1873 2028 2070 2324 2396 2501 2571 2762 2788 2804 2905 3035 3114 3147 3408 3512 3578 3751 3844 3852 3916 3928 
Solution for Two pass algorithm (greedy) for rank = 30
5 12 150 260 318 527 593 919 1023 1097 1193 1198 1265 1269 1301 1302 1348 1721 1873 2028 2070 2324 2501 2571 2762 2788 2804 2905 3035 3114 3132 3147 3408 3512 3578 3844 3916 3928 
Variance in % for rank = 30 0.0112044
Variance in % for rank = 30 0.0161252
Variance in % for rank = 30 0.0170991
Variance in % for rank = 40 0.0627892
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 40
3 4 5 6 7 8 9 10 11 12 14 16 18 19 24 26 27 30 31 36 38 39 152 177 3916 2028 527 260 2762 3952 3852 1193 858 1301 1196 909 3035 1097 1947 1961 1035 1294 1256 2070 1231 1302 1663 1240 3088 919 2804 953 1925 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 40
3 4 5 6 7 8 9 10 11 12 14 16 18 19 24 26 27 30 31 36 38 39 152 177 527 858 919 920 953 1035 1097 1193 1198 1242 1269 1294 1301 1302 1663 1925 1947 1961 2028 2150 2670 2762 2797 2804 3035 3114 3159 3508 3916 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 40
34 150 260 318 356 527 539 593 678 919 920 953 1023 1035 1097 1193 1196 1198 1203 1265 1270 1301 1302 1348 1393 1663 1721 1784 1873 1961 2028 2070 2324 2359 2396 2501 2762 2788 2804 2905 3035 3114 3147 3148 3408 3510 3512 3578 3751 3852 3897 3916 3928 
Solution for Two pass algorithm (greedy) for rank = 40
5 11 12 18 36 38 150 177 260 318 356 527 593 678 919 920 953 1023 1035 1097 1193 1196 1198 1203 1265 1270 1301 1302 1348 1663 1721 1873 1961 2028 2070 2324 2501 2762 2788 2804 2905 3035 3114 3132 3147 3408 3512 3578 3852 3916 3928 
Variance in % for rank = 40 0.0085554
Variance in % for rank = 40 0.00952935
Variance in % for rank = 40 0.00832839
Variance in % for rank = 50 0.0597345
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 50
3 4 5 6 7 8 9 10 11 12 14 16 17 18 19 22 24 26 27 30 31 34 36 37 38 39 40 43 45 52 152 177 3916 3952 2028 3852 527 260 1301 1198 1035 1947 3035 1193 909 858 1294 1196 1256 1302 1231 1292 1097 1961 1210 1663 3088 1172 3095 1270 953 1957 1925 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 50
3 4 5 6 7 8 9 10 11 12 14 16 17 18 19 22 24 26 27 30 31 34 36 37 38 39 40 43 45 52 152 177 260 356 527 919 920 953 1035 1097 1136 1193 1198 1203 1234 1240 1242 1269 1270 1301 1302 1663 1947 1961 2028 2150 2797 2804 2905 3035 3132 3159 3629 3916 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 50
34 62 150 260 318 356 457 480 527 539 593 678 919 920 953 1023 1035 1097 1136 1193 1196 1198 1203 1242 1265 1266 1270 1301 1302 1348 1393 1663 1704 1721 1784 1873 1961 2028 2070 2324 2359 2396 2501 2571 2762 2788 2797 2804 2858 2905 3035 3114 3147 3148 3408 3510 3512 3578 3751 3852 3897 3916 3928 
Solution for Two pass algorithm (greedy) for rank = 50
5 11 12 18 26 30 36 43 45 150 177 260 318 356 480 527 539 593 678 919 920 953 1023 1035 1097 1136 1193 1196 1198 1203 1242 1265 1270 1301 1302 1348 1663 1721 1873 1961 2028 2070 2324 2396 2501 2571 2762 2788 2797 2804 2905 3035 3114 3132 3147 3408 3512 3578 3751 3852 3916 3928 
Variance in % for rank = 50 0.00700864
Variance in % for rank = 50 0.00631806
Variance in % for rank = 50 0.00924353
Variance in % for rank = 60 0.0532184
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 60
3 4 5 6 7 8 9 10 11 12 14 15 16 17 18 19 22 24 26 27 30 31 34 36 37 38 39 40 41 43 45 52 53 54 55 63 152 177 188 3916 3952 2028 527 260 1198 3852 1301 1193 1035 3035 858 1947 909 1196 1294 1253 1276 1231 1302 1097 1292 1961 1210 1663 3508 3088 1172 953 3095 1269 1240 1957 919 1200 1225 1348 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 60
3 4 5 6 7 8 9 10 11 12 14 15 16 17 18 19 22 24 26 27 30 31 34 36 37 38 39 40 41 43 45 52 53 54 55 63 152 177 188 260 527 590 858 908 919 920 953 1035 1097 1136 1193 1196 1198 1203 1240 1242 1269 1270 1294 1301 1302 1307 1663 1925 1947 1961 2028 2150 2762 2797 2804 3035 3159 3873 3916 3928 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 60
11 34 50 62 73 150 260 318 356 440 480 524 527 539 588 589 590 593 678 919 920 953 1023 1035 1097 1136 1193 1196 1198 1203 1240 1242 1265 1266 1269 1270 1301 1302 1348 1393 1663 1704 1721 1784 1873 1947 1961 2028 2070 2150 2324 2359 2396 2501 2571 2728 2761 2762 2788 2797 2804 2858 2905 3035 3114 3147 3148 3408 3510 3512 3578 3751 3852 3897 3916 3928 
Solution for Two pass algorithm (greedy) for rank = 60
5 11 12 26 30 36 43 45 55 150 177 260 318 356 480 527 539 589 590 593 678 919 920 953 1023 1035 1097 1136 1193 1196 1198 1203 1240 1242 1265 1269 1270 1301 1302 1663 1721 1784 1873 1925 1947 1961 2028 2070 2150 2324 2396 2501 2571 2728 2762 2788 2797 2804 2905 3035 3114 3147 3148 3309 3408 3510 3512 3578 3751 3852 3897 3916 3928 
Variance in % for rank = 60 0.00927357
Variance in % for rank = 60 0.0116873
Variance in % for rank = 60 0.011285
Variance in % for rank = 70 0.0537899
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 70
3 4 5 6 7 8 9 10 11 12 14 15 16 17 18 19 22 23 24 25 26 27 30 31 34 36 37 38 39 40 41 43 45 52 53 54 55 57 62 63 65 68 152 177 188 3916 3952 2028 527 260 1198 3852 3512 2762 1301 1193 1035 3035 858 1947 909 1196 1253 1294 1276 1256 1254 1097 1961 1231 1210 1207 1302 1292 1270 3508 1663 3088 3095 953 1172 1240 2804 2352 1957 1200 1348 2823 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 70
3 4 5 6 7 8 9 10 11 12 14 15 16 17 18 19 22 23 24 25 26 27 30 31 34 36 37 38 39 40 41 43 45 52 53 54 55 57 62 63 65 68 152 177 188 260 318 527 590 908 919 920 953 1035 1036 1097 1136 1193 1196 1198 1203 1240 1242 1259 1269 1270 1272 1294 1301 1302 1307 1663 1925 1947 1961 2028 2150 2762 2797 2804 3035 3114 3159 3309 3471 3873 3916 3928 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 70
1 11 34 50 62 73 150 260 318 356 440 457 480 524 527 539 588 589 590 593 678 919 920 953 1023 1035 1036 1042 1097 1136 1193 1196 1198 1203 1240 1242 1250 1259 1265 1266 1269 1270 1301 1302 1348 1393 1663 1704 1721 1784 1873 1947 1961 2028 2070 2150 2321 2324 2336 2359 2396 2501 2571 2761 2762 2788 2797 2804 2858 2905 3035 3114 3147 3148 3255 3408 3510 3512 3536 3578 3751 3827 3852 3873 3897 3916 3928 
Solution for Two pass algorithm (greedy) for rank = 70
1 5 11 12 23 25 26 30 34 36 38 43 45 54 55 62 65 150 177 260 318 356 480 527 539 589 590 593 678 919 920 953 1023 1035 1036 1097 1136 1193 1196 1198 1203 1240 1242 1250 1259 1265 1269 1270 1301 1302 1348 1663 1704 1721 1784 1873 1947 1961 2028 2070 2150 2324 2396 2501 2571 2762 2788 2797 2804 2905 3035 3114 3132 3147 3148 3408 3510 3512 3578 3751 3827 3852 3873 3897 3916 3928 
Variance in % for rank = 70 0.00835392
Variance in % for rank = 70 0.00769547
Variance in % for rank = 70 0.00931562
Variance in % for rank = 80 0.0505669
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 80
3 4 5 6 7 8 9 10 11 12 14 15 16 17 18 19 20 22 23 24 25 26 27 28 29 30 31 32 34 36 37 38 39 40 41 42 43 45 51 52 53 54 55 57 59 62 63 65 67 68 69 72 73 152 177 188 196 3916 3952 260 1198 1193 858 3035 1035 1196 1294 1276 1947 1097 909 1272 1961 1302 1256 1231 1301 1283 1210 1292 2728 1270 953 3504 2804 1221 1172 1663 919 3095 1240 3088 1269 2352 1957 1242 1225 2797 1925 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 80
3 4 5 6 7 8 9 10 11 12 14 15 16 17 18 19 20 22 23 24 25 26 27 28 29 30 31 32 34 36 37 38 39 40 41 42 43 45 51 52 53 54 55 57 59 62 63 65 67 68 69 72 73 152 177 188 196 260 590 594 858 908 919 920 953 1035 1036 1097 1136 1193 1196 1198 1203 1225 1231 1234 1240 1242 1250 1269 1270 1272 1294 1301 1302 1307 1663 1925 1947 1961 2028 2150 2716 2797 2804 3035 3309 3873 3916 3928 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 80
1 11 34 50 62 150 260 318 356 440 457 480 524 527 539 588 589 590 593 678 745 919 920 953 1023 1035 1036 1042 1097 1136 1193 1196 1198 1203 1225 1234 1240 1242 1250 1259 1265 1266 1269 1270 1282 1301 1302 1307 1348 1393 1408 1663 1682 1704 1721 1784 1873 1923 1947 1961 2028 2070 2150 2302 2321 2324 2336 2359 2396 2501 2571 2761 2762 2788 2797 2804 2858 2905 3035 3114 3147 3148 3178 3255 3404 3408 3510 3512 3536 3578 3615 3751 3827 3852 3873 3897 3916 3928 3948 
Solution for Two pass algorithm (greedy) for rank = 80
1 5 11 12 23 25 26 30 34 36 38 42 43 45 54 55 62 65 69 150 177 196 260 318 356 457 480 527 539 589 590 593 678 919 920 953 1023 1035 1036 1097 1136 1193 1196 1198 1203 1225 1234 1240 1242 1250 1259 1265 1269 1270 1282 1301 1302 1307 1348 1663 1704 1721 1784 1873 1947 1961 2028 2070 2150 2324 2396 2501 2571 2762 2788 2797 2804 2905 3035 3114 3132 3147 3148 3404 3408 3510 3512 3578 3751 3827 3852 3873 3897 3916 3928 
Variance in % for rank = 80 0.00458002
Variance in % for rank = 80 0.00761344
Variance in % for rank = 80 0.0054822
Variance in % for rank = 90 0.0534944
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 90
3 4 5 6 7 8 9 10 11 12 14 15 16 17 18 19 20 22 23 24 25 26 27 28 29 30 31 32 34 36 37 38 39 40 41 42 43 45 51 52 53 54 55 56 57 59 62 63 65 67 68 69 72 73 75 77 78 80 84 152 177 188 196 3916 3952 2028 260 1198 1193 858 3035 1035 1196 1294 1276 1947 1097 909 1272 1961 1302 1262 1231 1301 1210 1283 2728 1292 1259 1270 953 2804 1221 3504 1172 3508 1663 919 3095 1240 3088 1269 2352 1957 1242 541 1225 2797 920 3928 1925 1348 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 90
3 4 5 6 7 8 9 10 11 12 14 15 16 17 18 19 20 22 23 24 25 26 27 28 29 30 31 32 34 36 37 38 39 40 41 42 43 45 51 52 53 54 55 56 57 59 62 63 65 67 68 69 72 73 75 77 78 80 84 152 177 188 196 260 527 590 858 908 919 920 953 1035 1036 1097 1136 1193 1196 1198 1203 1207 1225 1231 1234 1240 1242 1250 1259 1269 1270 1282 1294 1301 1302 1307 1610 1663 1925 1947 1961 2028 2150 2716 2797 2804 3035 3037 3088 3309 3471 3629 3873 3916 3928 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 90
1 11 34 50 62 73 150 260 318 356 440 457 480 524 527 539 588 589 590 593 608 678 745 858 919 920 953 957 1023 1035 1036 1042 1097 1136 1193 1196 1197 1198 1203 1225 1240 1242 1250 1259 1265 1266 1269 1270 1282 1294 1301 1302 1307 1348 1393 1408 1617 1663 1682 1704 1721 1784 1873 1923 1947 1961 2028 2070 2150 2302 2321 2324 2336 2359 2396 2501 2571 2671 2716 2761 2762 2788 2797 2804 2858 2905 3035 3088 3114 3147 3148 3155 3178 3255 3404 3408 3471 3510 3512 3536 3578 3615 3624 3751 3827 3852 3873 3897 3916 3928 3948 3952 
Solution for Two pass algorithm (greedy) for rank = 90
1 5 10 11 12 18 23 25 26 30 34 36 38 42 43 45 54 55 56 62 65 69 75 77 78 150 177 196 260 318 356 457 480 527 539 589 590 593 678 858 919 920 953 1023 1035 1036 1097 1136 1193 1196 1197 1198 1203 1225 1240 1242 1250 1259 1265 1266 1269 1270 1282 1294 1301 1302 1307 1348 1393 1663 1704 1721 1784 1873 1925 1947 1961 2028 2070 2150 2324 2359 2396 2501 2571 2716 2762 2788 2797 2804 2905 3035 3088 3114 3147 3148 3309 3404 3408 3471 3510 3512 3578 3751 3827 3852 3873 3897 3916 3928 
Variance in % for rank = 90 0.00545035
Variance in % for rank = 90 0.00780727
Variance in % for rank = 90 0.00718258
Variance in % for rank = 100 0.0536706
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 100
3 4 5 6 7 8 9 10 11 12 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 34 35 36 37 38 39 40 41 42 43 45 51 52 53 54 55 56 57 59 61 62 63 65 67 68 69 72 73 75 77 78 80 82 83 84 87 152 177 188 196 210 220 3916 3952 260 1198 1193 858 1035 3035 1196 1294 1947 1097 1276 909 1961 1302 1207 1231 1272 1301 1210 1256 1292 1259 1270 2728 1283 912 1253 2804 953 1172 1221 3504 2150 1234 919 1663 1240 3095 3088 1269 2352 1957 1242 1225 2797 1200 1293 1036 3629 3022 3309 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 100
3 4 5 6 7 8 9 10 11 12 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 34 35 36 37 38 39 40 41 42 43 45 51 52 53 54 55 56 57 59 61 62 63 65 67 68 69 72 73 75 77 78 80 82 83 84 87 152 177 188 196 210 220 260 590 858 908 912 919 920 953 1035 1036 1097 1136 1193 1196 1198 1203 1207 1225 1231 1234 1240 1242 1250 1259 1269 1270 1272 1278 1282 1294 1301 1302 1307 1610 1663 1947 1957 1961 2028 2080 2150 2407 2716 2797 2804 3022 3035 3309 3471 3629 3873 3916 3928 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 100
1 11 34 50 62 73 150 260 318 356 357 367 380 440 457 480 500 524 527 539 588 589 590 593 608 678 745 858 919 920 953 957 1023 1035 1036 1042 1097 1136 1193 1196 1197 1198 1203 1225 1231 1234 1240 1242 1250 1259 1265 1266 1269 1270 1272 1282 1287 1301 1302 1307 1348 1393 1408 1610 1617 1663 1682 1704 1721 1784 1873 1923 1947 1961 2028 2070 2150 2302 2321 2324 2336 2359 2396 2424 2501 2571 2671 2692 2716 2761 2762 2788 2797 2804 2841 2858 2905 3035 3088 3114 3147 3148 3155 3178 3189 3255 3404 3408 3471 3510 3512 3536 3578 3615 3751 3827 3852 3873 3897 3916 3928 3948 3952 
Solution for Two pass algorithm (greedy) for rank = 100
1 5 11 12 18 23 25 26 30 34 35 36 38 42 43 45 54 55 56 61 62 65 69 75 77 78 82 87 150 177 196 260 318 356 440 457 480 527 539 588 589 590 593 678 858 919 920 953 1023 1035 1036 1097 1136 1193 1196 1197 1198 1203 1225 1231 1234 1240 1242 1250 1259 1265 1266 1269 1270 1272 1282 1287 1301 1302 1307 1348 1393 1610 1663 1704 1721 1784 1873 1925 1947 1961 2028 2070 2150 2324 2359 2396 2501 2571 2716 2762 2788 2797 2804 2858 2905 3035 3088 3114 3147 3148 3309 3404 3408 3471 3510 3512 3578 3751 3827 3852 3873 3897 3916 3928 
Variance in % for rank = 100 0.00437893
Variance in % for rank = 100 0.00493814
Variance in % for rank = 100 0.0066225
Variance in % for rank = 110 0.0558766
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 110
3 4 5 6 7 8 9 10 11 12 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 34 35 36 37 38 39 40 41 42 43 45 46 51 52 53 54 55 56 57 59 61 62 63 65 66 67 68 69 72 73 75 77 78 80 82 83 84 87 88 90 93 94 110 152 177 188 196 210 220 3916 3952 3512 1035 3035 1947 1294 1276 909 1302 1207 1301 1231 1272 1292 1262 2728 260 1198 1283 1172 1253 953 3504 1254 1303 2150 2804 1663 1234 1097 2352 3095 3088 1193 1269 1957 919 1270 858 2788 1961 3359 2797 1242 1240 1293 1307 1246 1036 955 3361 3928 3360 1225 920 1210 2010 1348 2823 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 110
3 4 5 6 7 8 9 10 11 12 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 34 35 36 37 38 39 40 41 42 43 45 46 51 52 53 54 55 56 57 59 61 62 63 65 66 67 68 69 72 73 75 77 78 80 82 83 84 87 88 90 93 94 110 152 177 188 196 210 220 260 527 590 594 858 908 919 920 953 1035 1036 1097 1136 1193 1196 1197 1198 1203 1207 1225 1231 1233 1234 1240 1242 1250 1253 1259 1269 1270 1276 1278 1282 1294 1301 1302 1307 1610 1663 1947 1957 1961 2018 2028 2150 2407 2716 2797 2804 3022 3035 3037 3088 3363 3471 3629 3873 3916 3928 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 110
1 11 34 36 50 60 62 73 150 260 318 356 357 367 377 380 440 457 480 500 524 527 539 588 589 590 593 608 678 745 858 919 920 953 957 1023 1035 1036 1042 1097 1136 1193 1196 1197 1198 1203 1225 1231 1233 1234 1240 1242 1250 1259 1265 1266 1269 1270 1272 1278 1282 1287 1294 1301 1302 1307 1348 1393 1396 1408 1580 1610 1617 1663 1682 1704 1721 1784 1873 1923 1947 1957 1961 2028 2070 2150 2302 2321 2324 2336 2359 2396 2398 2424 2501 2571 2671 2692 2716 2761 2762 2788 2797 2804 2841 2858 2905 3035 3088 3095 3114 3147 3148 3155 3175 3178 3189 3255 3404 3408 3471 3510 3512 3513 3536 3578 3615 3751 3827 3852 3873 3897 3911 3916 3928 3948 3952 
Solution for Two pass algorithm (greedy) for rank = 110
1 5 11 12 18 23 25 26 30 34 35 36 38 42 43 45 50 54 55 56 61 62 65 69 75 77 78 82 87 93 150 177 196 260 318 356 440 457 480 524 527 539 588 589 590 593 594 678 858 919 920 953 1023 1035 1036 1042 1097 1136 1193 1196 1197 1198 1203 1225 1231 1233 1234 1240 1242 1250 1259 1265 1266 1269 1270 1272 1278 1282 1287 1294 1301 1302 1307 1393 1580 1610 1663 1704 1721 1784 1873 1925 1947 1957 1961 2028 2070 2150 2324 2359 2396 2398 2501 2571 2716 2762 2788 2797 2804 2858 2905 3035 3088 3114 3147 3148 3175 3309 3404 3408 3471 3510 3512 3578 3629 3751 3827 3852 3873 3897 3916 3928 
Variance in % for rank = 110 0.00585236
Variance in % for rank = 110 0.0073191
Variance in % for rank = 110 0.00667169
Variance in % for rank = 120 0.0545198
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 120
1 3 4 5 6 7 8 9 10 11 12 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 45 46 47 51 52 53 54 55 56 57 59 61 62 63 65 66 67 68 69 71 72 73 75 76 77 78 80 82 83 84 87 88 90 93 94 96 97 101 110 152 177 188 196 210 220 253 3916 1035 3035 1947 1294 1276 909 1302 1272 1207 1231 1262 1292 2728 260 1283 1198 3037 1301 1172 953 1254 3504 2150 2804 1253 1234 1663 2352 3088 910 1097 3095 1269 1193 1957 919 3508 1270 858 2788 3359 1961 1196 1242 2797 1240 1293 1307 1246 1036 955 3361 3360 1225 920 923 2716 1210 1674 1348 1925 2823 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 120
1 3 4 5 6 7 8 9 10 11 12 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 45 46 47 51 52 53 54 55 56 57 59 61 62 63 65 66 67 68 69 71 72 73 75 76 77 78 80 82 83 84 87 88 90 93 94 96 97 101 110 152 177 188 196 210 220 253 260 590 594 858 908 919 920 953 1035 1036 1097 1136 1172 1193 1196 1198 1200 1203 1207 1225 1231 1233 1234 1240 1242 1250 1259 1269 1270 1272 1276 1278 1282 1294 1301 1302 1307 1387 1610 1663 1674 1925 1947 1957 1961 2018 2080 2150 2407 2716 2728 2797 2804 3035 3037 3088 3363 3471 3629 3873 3916 3928 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 120
1 11 17 34 36 50 60 62 73 150 260 318 337 356 357 367 377 380 440 457 480 500 508 524 527 539 553 588 589 590 593 608 678 745 858 908 919 920 953 957 1023 1035 1036 1042 1097 1136 1193 1196 1197 1198 1203 1207 1210 1225 1231 1233 1234 1240 1242 1250 1259 1265 1266 1269 1270 1272 1278 1282 1287 1294 1301 1302 1307 1348 1393 1396 1408 1537 1580 1610 1617 1663 1682 1693 1704 1721 1784 1797 1873 1923 1947 1957 1961 2028 2070 2150 2302 2321 2324 2336 2359 2396 2398 2407 2424 2501 2571 2671 2692 2716 2761 2762 2788 2797 2804 2841 2858 2905 3035 3088 3095 3114 3147 3148 3155 3175 3178 3189 3255 3363 3404 3408 3471 3510 3512 3513 3536 3578 3615 3751 3827 3852 3873 3897 3911 3916 3928 3948 3952 
Solution for Two pass algorithm (greedy) for rank = 120
1 5 11 12 18 23 25 26 30 34 35 36 38 42 43 45 50 54 55 56 61 62 69 77 78 82 87 93 97 101 150 177 196 253 260 318 356 440 457 480 524 527 539 588 589 590 593 594 678 858 908 919 920 953 1023 1035 1036 1042 1097 1136 1193 1196 1197 1198 1203 1207 1210 1225 1231 1233 1234 1240 1242 1250 1259 1265 1266 1269 1270 1272 1278 1282 1287 1294 1301 1302 1307 1393 1580 1610 1663 1704 1721 1784 1873 1925 1947 1957 1961 2028 2070 2150 2321 2324 2359 2396 2398 2407 2501 2571 2716 2762 2788 2797 2804 2858 2905 3035 3088 3114 3147 3148 3175 3255 3309 3363 3404 3408 3471 3510 3512 3536 3578 3629 3751 3827 3852 3873 3897 3916 3928 
Variance in % for rank = 120 0.00701335
Variance in % for rank = 120 0.00798337
Variance in % for rank = 120 0.00856919
Variance in % for rank = 130 0.0563082
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 130
1 3 4 5 6 7 8 9 10 11 12 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 45 46 47 48 51 52 53 54 55 56 57 59 61 62 63 65 66 67 68 69 70 71 72 73 75 76 77 78 80 82 83 84 87 88 90 93 94 96 97 99 101 102 104 110 114 120 152 177 188 196 210 220 253 3916 3035 1035 1294 1276 1947 909 1302 1272 1207 1231 1262 1292 1256 2728 260 1198 3037 1283 1301 1172 953 1254 3504 1303 2804 2150 1234 1253 2352 1097 3088 910 1663 3095 1193 1269 1957 919 1270 3508 858 3359 1961 2788 1242 2797 1240 1293 1307 1036 1246 955 3361 1225 3360 2716 923 1210 1674 2915 2407 2010 1348 2823 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 130
1 3 4 5 6 7 8 9 10 11 12 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 45 46 47 48 51 52 53 54 55 56 57 59 61 62 63 65 66 67 68 69 70 71 72 73 75 76 77 78 80 82 83 84 87 88 90 93 94 96 97 99 101 102 104 110 114 120 152 177 188 196 210 220 253 260 590 594 858 908 912 919 920 953 1035 1036 1097 1136 1172 1193 1196 1197 1198 1200 1203 1207 1225 1231 1233 1234 1240 1242 1250 1259 1269 1270 1272 1276 1278 1282 1294 1301 1302 1307 1374 1387 1610 1663 1674 1947 1957 1961 2080 2150 2407 2716 2728 2797 2804 3022 3035 3037 3088 3309 3363 3471 3629 3873 3916 3928 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 130
1 11 17 34 36 50 60 62 73 110 150 161 260 266 317 318 356 357 367 377 380 440 457 480 500 508 524 527 539 553 588 589 590 593 594 608 678 745 858 919 920 953 1023 1035 1036 1042 1097 1136 1172 1193 1196 1197 1198 1200 1203 1207 1210 1225 1231 1233 1234 1240 1242 1250 1253 1259 1265 1266 1269 1270 1272 1278 1282 1287 1294 1301 1302 1307 1348 1356 1393 1396 1408 1537 1580 1610 1617 1641 1663 1682 1704 1721 1784 1873 1923 1926 1947 1957 1961 2028 2070 2150 2268 2302 2321 2324 2336 2359 2396 2398 2407 2424 2501 2571 2671 2692 2716 2761 2762 2788 2797 2804 2841 2858 2905 3035 3088 3114 3147 3148 3155 3159 3175 3178 3189 3255 3363 3404 3408 3450 3471 3481 3510 3512 3513 3536 3578 3615 3751 3827 3852 3873 3897 3911 3916 3928 3948 3952 
Solution for Two pass algorithm (greedy) for rank = 130
1 5 11 12 18 23 25 26 30 34 35 36 38 42 43 45 48 50 54 55 56 61 62 65 69 70 77 78 82 87 93 97 101 104 110 150 177 196 253 260 318 356 440 457 480 524 527 539 588 589 590 593 594 678 858 919 920 953 1023 1035 1036 1042 1097 1136 1172 1193 1196 1197 1198 1200 1203 1207 1210 1225 1231 1233 1234 1240 1242 1250 1253 1259 1265 1266 1269 1270 1272 1278 1282 1287 1294 1301 1302 1307 1356 1393 1580 1610 1663 1704 1721 1784 1873 1923 1925 1947 1957 1961 2028 2070 2150 2321 2324 2359 2396 2398 2407 2501 2571 2716 2762 2788 2797 2804 2858 2905 3035 3088 3114 3147 3148 3159 3175 3255 3309 3363 3404 3408 3471 3510 3512 3536 3578 3629 3751 3827 3852 3873 3897 3916 3928 
Variance in % for rank = 130 0.00897639
Variance in % for rank = 130 0.0101878
Variance in % for rank = 130 0.00766814
Variance in % for rank = 140 0.0515014
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 140
1 3 4 5 6 7 8 9 10 11 12 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 45 46 47 48 49 51 52 53 54 55 56 57 59 60 61 62 63 65 66 67 68 69 70 71 72 73 75 76 77 78 79 80 82 83 84 87 88 90 93 94 96 97 99 101 102 104 106 109 110 114 120 121 124 139 152 177 188 196 210 220 253 273 3035 1035 1294 1276 1947 909 1302 1207 1272 1231 1262 1292 1256 2728 260 1198 3037 1283 1172 953 1301 1254 3504 1303 2804 2150 1234 1253 2352 1097 3088 910 3095 1663 1193 899 1269 3873 1957 919 1270 3508 858 1961 3359 2788 1196 1242 2797 1240 1293 1307 1036 1246 955 3361 1225 3360 2716 1210 923 1674 2915 1200 2407 1374 2398 1348 1925 2823 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 140
1 3 4 5 6 7 8 9 10 11 12 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 45 46 47 48 49 51 52 53 54 55 56 57 59 60 61 62 63 65 66 67 68 69 70 71 72 73 75 76 77 78 79 80 82 83 84 87 88 90 93 94 96 97 99 101 102 104 106 109 110 114 120 121 124 139 152 177 188 196 210 220 253 260 273 587 590 594 858 899 908 912 919 920 953 1035 1036 1097 1101 1136 1172 1193 1196 1198 1200 1203 1207 1225 1231 1233 1234 1240 1242 1250 1259 1269 1270 1272 1276 1278 1282 1294 1301 1302 1307 1374 1387 1610 1663 1674 1925 1947 1957 1961 2080 2150 2398 2407 2716 2728 2791 2797 2804 3035 3037 3072 3088 3363 3471 3629 3873 3927 3928 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 140
1 11 17 34 36 50 60 62 73 110 150 161 260 266 317 318 337 356 357 367 377 380 440 457 480 500 508 524 527 529 539 553 588 589 590 593 594 608 678 745 858 899 908 919 920 923 953 957 1023 1035 1036 1042 1097 1136 1172 1193 1196 1197 1198 1200 1203 1207 1210 1225 1231 1233 1234 1240 1242 1250 1259 1265 1266 1269 1270 1272 1278 1282 1291 1294 1301 1302 1307 1348 1356 1374 1387 1393 1396 1408 1537 1580 1610 1617 1641 1663 1682 1693 1704 1721 1784 1797 1873 1923 1947 1957 1961 2028 2070 2080 2150 2268 2297 2302 2321 2324 2336 2359 2396 2398 2407 2424 2501 2571 2671 2686 2692 2716 2761 2762 2788 2797 2804 2841 2858 2905 3035 3037 3060 3088 3114 3147 3148 3155 3159 3175 3178 3185 3189 3255 3363 3404 3408 3450 3471 3481 3510 3512 3513 3536 3578 3615 3751 3827 3852 3873 3897 3911 3916 3928 3948 3952 
Solution for Two pass algorithm (greedy) for rank = 140
1 5 11 12 18 23 25 26 29 30 34 35 36 38 42 43 45 48 50 55 56 61 62 65 69 70 73 77 78 82 87 93 97 101 104 110 124 150 177 196 253 260 318 356 440 457 480 524 527 539 588 589 590 593 594 678 745 858 899 908 919 920 923 953 1023 1035 1036 1042 1097 1136 1172 1193 1196 1197 1198 1200 1203 1207 1210 1225 1231 1233 1234 1240 1242 1250 1259 1265 1266 1269 1270 1272 1278 1282 1291 1294 1301 1302 1307 1374 1387 1393 1580 1610 1617 1663 1704 1721 1784 1873 1923 1925 1947 1957 1961 2028 2070 2080 2150 2302 2321 2324 2336 2359 2396 2398 2407 2501 2571 2716 2761 2762 2788 2797 2804 2858 2905 3035 3037 3088 3114 3147 3148 3159 3175 3255 3309 3363 3404 3408 3471 3510 3512 3536 3578 3629 3751 3827 3852 3873 3897 3916 3928 3948 
Variance in % for rank = 140 0.00610762
Variance in % for rank = 140 0.00725297
Variance in % for rank = 140 0.00530188
Variance in % for rank = 150 0.0540282
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 150
1 3 4 5 6 7 8 9 10 11 12 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 48 49 50 51 52 53 54 55 56 57 59 60 61 62 63 65 66 67 68 69 70 71 72 73 75 76 77 78 79 80 82 83 84 87 88 90 93 94 96 97 99 101 102 104 106 107 109 110 113 114 115 118 120 121 124 127 130 139 152 173 177 188 196 210 220 775 841 1035 3035 1294 1276 1947 909 1302 1272 1207 1231 1262 1292 1256 2728 3037 1198 260 1283 1172 953 1301 3504 1254 1303 2804 2150 1234 1253 2352 1097 3088 1663 910 3095 1957 1269 919 1193 1270 3508 1961 2788 3359 1242 858 2797 1196 3471 1240 1293 1307 1036 1246 3361 1225 955 3360 2716 920 1210 923 1674 2915 1200 1610 2407 3928 1233 1291 3629 1348 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 150
1 3 4 5 6 7 8 9 10 11 12 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 48 49 50 51 52 53 54 55 56 57 59 60 61 62 63 65 66 67 68 69 70 71 72 73 75 76 77 78 79 80 82 83 84 87 88 90 93 94 96 97 99 101 102 104 106 107 109 110 113 114 115 118 120 121 124 127 130 139 152 173 177 188 196 210 220 260 587 590 594 775 841 858 908 912 919 920 953 1035 1036 1097 1101 1136 1172 1193 1196 1198 1200 1203 1207 1210 1225 1231 1233 1234 1240 1242 1250 1259 1269 1270 1272 1278 1282 1292 1294 1301 1302 1307 1374 1387 1610 1663 1674 1925 1947 1957 1961 2080 2150 2398 2407 2716 2728 2791 2797 2804 2918 3035 3037 3072 3088 3095 3363 3471 3629 3873 3927 3928 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 150
1 11 17 34 36 50 60 62 73 110 141 150 161 260 266 296 317 318 337 356 357 367 377 380 440 457 480 500 508 524 527 529 539 551 553 587 588 589 590 593 594 608 648 678 745 858 908 919 920 923 953 957 1023 1035 1036 1042 1097 1136 1172 1193 1196 1197 1198 1200 1203 1207 1210 1214 1223 1225 1231 1233 1234 1240 1242 1250 1253 1259 1265 1266 1269 1270 1272 1278 1282 1291 1294 1301 1302 1307 1348 1356 1358 1374 1387 1393 1396 1408 1537 1580 1610 1617 1641 1663 1674 1682 1693 1704 1721 1784 1797 1873 1923 1947 1957 1961 2028 2070 2080 2150 2268 2297 2302 2321 2324 2329 2336 2359 2396 2398 2407 2424 2501 2571 2671 2686 2692 2716 2761 2762 2788 2797 2804 2841 2858 2905 3035 3037 3060 3088 3095 3114 3147 3148 3155 3159 3175 3178 3185 3189 3255 3363 3404 3408 3450 3471 3481 3510 3512 3513 3536 3578 3615 3751 3827 3852 3873 3897 3911 3916 3928 3948 3952 
Solution for Two pass algorithm (greedy) for rank = 150
1 5 11 12 18 23 25 26 29 30 34 35 36 38 42 43 44 45 48 50 54 55 56 61 62 65 69 70 73 77 78 82 87 93 97 101 104 107 110 113 118 124 130 150 177 196 260 318 356 440 457 480 524 527 539 587 588 589 590 593 594 678 745 775 858 908 919 920 923 953 1023 1035 1036 1042 1097 1136 1172 1193 1196 1197 1198 1200 1203 1207 1210 1214 1225 1231 1233 1234 1240 1242 1250 1253 1259 1265 1266 1269 1270 1272 1278 1282 1291 1294 1301 1302 1307 1374 1387 1393 1408 1580 1610 1617 1663 1674 1704 1721 1784 1873 1923 1925 1947 1957 1961 2028 2070 2080 2150 2302 2321 2324 2336 2359 2396 2398 2407 2501 2571 2671 2716 2761 2762 2788 2797 2804 2858 2905 3035 3088 3095 3114 3147 3148 3159 3175 3255 3309 3363 3404 3408 3471 3510 3512 3536 3578 3629 3751 3827 3852 3873 3897 3916 3928 3948 
Variance in % for rank = 150 0.00375694
Variance in % for rank = 150 0.00384119
Variance in % for rank = 150 0.00404661
Variance in % for rank = 160 0.0532869
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 160
1 3 4 5 6 7 8 9 10 11 12 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 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 65 66 67 68 69 70 71 72 73 75 76 77 78 79 80 82 83 84 87 88 89 90 93 94 96 97 99 101 102 104 106 107 109 110 113 114 115 118 119 120 121 122 124 127 130 138 139 145 151 152 173 177 188 196 210 220 775 841 1128 3035 1035 1294 1276 1947 1302 909 1272 1231 1207 1262 1292 1256 2728 1198 260 3037 1283 953 1172 1301 1254 3504 2804 2150 1303 1234 1253 1097 2352 3088 3095 1957 910 899 1269 1663 919 1193 1270 2300 3508 1961 1242 858 2788 2797 3359 1196 3471 1240 1293 1307 1036 1246 3361 1225 955 3360 2716 920 1210 923 1674 1200 1610 2915 2407 1233 3928 1291 1079 3072 1348 1925 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 160
1 3 4 5 6 7 8 9 10 11 12 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 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 65 66 67 68 69 70 71 72 73 75 76 77 78 79 80 82 83 84 87 88 89 90 93 94 96 97 99 101 102 104 106 107 109 110 113 114 115 118 119 120 121 122 124 127 130 138 139 145 151 152 173 177 188 196 210 220 260 587 590 594 775 841 858 904 908 912 919 920 953 1035 1036 1097 1101 1128 1136 1172 1193 1196 1198 1200 1203 1207 1210 1225 1231 1233 1234 1240 1242 1246 1250 1259 1269 1270 1272 1276 1278 1282 1292 1294 1301 1302 1307 1374 1387 1610 1663 1674 1925 1947 1957 1961 2080 2150 2352 2398 2407 2716 2728 2791 2797 2804 2918 3035 3037 3072 3088 3095 3363 3471 3629 3873 3927 3928 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 160
1 11 17 34 36 50 60 62 73 110 141 150 161 246 260 266 296 317 318 337 356 357 367 377 380 440 457 480 497 500 508 524 527 529 539 553 587 588 589 590 593 594 608 648 678 736 745 858 899 908 919 920 923 953 957 1023 1035 1036 1042 1097 1101 1136 1172 1193 1196 1197 1198 1200 1203 1207 1210 1214 1223 1225 1231 1233 1234 1240 1242 1250 1253 1259 1265 1266 1269 1270 1272 1276 1278 1282 1287 1291 1294 1301 1302 1307 1348 1356 1358 1374 1387 1393 1396 1408 1537 1580 1610 1617 1641 1653 1663 1674 1682 1693 1704 1721 1784 1797 1873 1907 1923 1947 1957 1961 2028 2070 2150 2268 2297 2302 2321 2324 2329 2336 2359 2396 2398 2407 2424 2501 2571 2671 2686 2692 2716 2761 2762 2788 2791 2797 2804 2841 2858 2905 2997 3006 3035 3037 3060 3072 3088 3095 3114 3147 3148 3155 3159 3175 3178 3185 3189 3255 3363 3404 3408 3450 3471 3481 3510 3512 3513 3536 3578 3615 3751 3753 3827 3852 3873 3897 3911 3916 3928 3948 3952 
Solution for Two pass algorithm (greedy) for rank = 160
1 5 11 12 18 23 25 26 29 30 34 35 36 38 42 43 45 48 50 54 55 56 58 61 62 65 69 70 73 75 77 78 82 87 89 93 97 101 104 110 113 118 122 124 130 150 177 196 260 317 318 356 440 457 480 524 527 539 587 588 589 590 593 594 678 745 775 858 899 908 919 920 923 953 1023 1035 1036 1042 1097 1101 1128 1136 1172 1193 1196 1197 1198 1200 1203 1207 1210 1214 1225 1231 1233 1234 1240 1242 1250 1253 1259 1265 1266 1269 1270 1272 1278 1282 1287 1291 1294 1301 1302 1307 1356 1374 1387 1393 1408 1580 1610 1617 1663 1674 1704 1721 1784 1873 1923 1925 1947 1957 1961 2028 2070 2150 2302 2321 2324 2336 2359 2396 2398 2407 2501 2571 2671 2716 2761 2762 2788 2797 2804 2858 2905 3035 3037 3072 3088 3095 3114 3147 3148 3159 3175 3255 3309 3363 3404 3408 3471 3510 3512 3536 3578 3629 3751 3753 3827 3852 3873 3897 3916 3928 3948 
Variance in % for rank = 160 0.00275618
Variance in % for rank = 160 0.0042302
Variance in % for rank = 160 0.00271042
Variance in % for rank = 170 0.0523199
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 170
1 3 4 5 6 7 8 9 10 11 12 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 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 65 66 67 68 69 70 71 72 73 75 76 77 78 79 80 82 83 84 87 88 89 90 93 94 96 97 99 101 102 104 106 107 108 109 110 113 114 115 118 119 120 121 122 124 125 127 129 130 138 139 142 143 145 151 152 173 177 188 196 210 220 253 273 285 3916 1035 3035 1294 1276 1947 1302 1272 909 1207 1231 1262 1256 1292 2728 1198 260 3037 1283 953 1172 1301 1254 2804 3504 2150 1303 1234 1253 1097 2352 3088 3095 1957 910 899 1269 919 1193 1663 1270 2300 3508 3927 3873 1203 1961 1242 858 2797 2788 1196 3359 3471 1240 1278 1293 3363 1307 1036 590 1246 1225 3361 955 3360 2716 920 1210 923 1674 1200 1610 2407 2915 3928 1233 1291 1376 1101 2398 1348 1925 978 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 170
1 3 4 5 6 7 8 9 10 11 12 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 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 65 66 67 68 69 70 71 72 73 75 76 77 78 79 80 82 83 84 87 88 89 90 93 94 96 97 99 101 102 104 106 107 108 109 110 113 114 115 118 119 120 121 122 124 125 127 129 130 138 139 142 143 145 151 152 173 177 188 196 210 220 253 260 273 285 587 590 594 858 899 904 908 912 913 919 920 923 953 1028 1035 1036 1097 1101 1136 1172 1193 1196 1197 1198 1200 1203 1207 1210 1214 1225 1231 1233 1234 1240 1242 1246 1250 1259 1269 1270 1272 1276 1278 1282 1292 1294 1301 1302 1304 1307 1348 1374 1387 1610 1663 1674 1925 1947 1957 1961 2080 2150 2352 2398 2407 2716 2728 2791 2797 2804 2918 3035 3037 3072 3088 3095 3363 3421 3471 3629 3873 3916 3927 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 170
1 11 17 34 36 50 60 62 73 110 141 150 161 246 260 266 296 314 317 318 337 356 357 367 377 380 440 457 480 497 500 508 524 527 529 539 551 553 587 588 589 590 593 594 608 648 678 736 745 858 899 908 913 919 920 923 953 957 978 1023 1035 1036 1042 1059 1097 1101 1136 1172 1193 1196 1197 1198 1200 1203 1207 1210 1214 1223 1225 1231 1233 1234 1240 1242 1246 1250 1253 1259 1265 1266 1269 1270 1272 1276 1278 1282 1287 1291 1294 1301 1302 1304 1307 1348 1356 1358 1374 1387 1393 1396 1408 1537 1544 1580 1610 1617 1641 1653 1663 1674 1682 1693 1704 1721 1784 1797 1873 1907 1923 1947 1957 1961 2006 2028 2070 2150 2268 2297 2302 2321 2324 2329 2336 2352 2359 2396 2398 2407 2424 2501 2571 2671 2686 2692 2716 2761 2762 2788 2791 2797 2804 2841 2858 2905 2997 3006 3035 3037 3060 3072 3088 3095 3114 3147 3148 3155 3159 3173 3175 3178 3185 3189 3255 3256 3363 3404 3408 3421 3450 3471 3481 3510 3512 3513 3536 3578 3615 3624 3751 3753 3827 3852 3873 3897 3911 3916 3928 3948 3952 
Solution for Two pass algorithm (greedy) for rank = 170
1 5 11 12 18 23 25 26 29 30 34 35 36 38 42 43 44 45 48 50 55 56 58 61 62 65 69 70 73 77 78 82 87 89 93 97 101 104 107 108 110 113 118 122 124 130 142 150 177 196 253 260 317 318 356 440 457 480 524 527 539 587 588 589 590 593 594 678 745 858 899 908 913 919 920 923 953 1023 1035 1036 1042 1097 1101 1136 1172 1193 1196 1197 1198 1200 1203 1207 1210 1214 1225 1231 1233 1234 1240 1242 1246 1250 1253 1259 1265 1266 1269 1270 1272 1276 1278 1282 1287 1291 1294 1301 1302 1304 1307 1356 1374 1387 1393 1408 1580 1610 1617 1663 1674 1682 1704 1721 1784 1873 1923 1925 1947 1957 1961 2028 2070 2150 2302 2321 2324 2336 2359 2396 2398 2407 2501 2571 2671 2716 2761 2762 2788 2791 2797 2804 2858 2905 3022 3035 3037 3072 3088 3095 3114 3147 3148 3155 3159 3175 3189 3255 3309 3363 3404 3408 3421 3471 3510 3512 3536 3578 3624 3629 3751 3753 3827 3852 3873 3897 3916 3928 3948 
Variance in % for rank = 170 0.00466092
Variance in % for rank = 170 0.00755234
Variance in % for rank = 170 0.00630735
Variance in % for rank = 180 0.047847
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 180
1 3 4 5 6 7 8 9 10 11 12 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 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 75 76 77 78 79 80 82 83 84 87 88 89 90 92 93 94 96 97 99 101 102 104 106 107 108 109 110 113 114 115 118 119 120 121 122 124 125 126 127 129 130 133 135 138 139 142 143 145 147 148 151 152 168 173 177 188 196 210 220 253 273 285 775 3035 1035 1294 1276 1947 1302 1272 909 1207 1231 1262 1256 1292 2728 1198 260 3037 1283 953 1172 1301 1254 2804 3504 2150 1303 1234 1253 1097 2352 3088 3095 1957 910 899 1269 919 1193 1663 1270 2300 3508 3927 1203 1961 1242 858 2797 2788 1196 3359 3471 1240 1278 1293 3363 1307 1287 1036 1136 590 1246 1225 3361 955 3360 2716 920 1210 923 1674 1200 1610 2407 2915 1374 3928 1233 1291 1079 1101 2872 2398 1348 1925 978 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 180
1 3 4 5 6 7 8 9 10 11 12 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 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 75 76 77 78 79 80 82 83 84 87 88 89 90 92 93 94 96 97 99 101 102 104 106 107 108 109 110 113 114 115 118 119 120 121 122 124 125 126 127 129 130 133 135 138 139 142 143 145 147 148 151 152 168 173 177 188 196 210 220 253 260 273 285 587 590 594 775 858 899 904 908 912 913 919 920 923 953 957 1035 1036 1073 1097 1101 1136 1172 1193 1196 1197 1198 1200 1203 1207 1210 1214 1225 1231 1233 1234 1240 1242 1246 1250 1253 1259 1269 1270 1272 1276 1278 1282 1292 1293 1294 1301 1302 1304 1307 1348 1374 1387 1610 1663 1674 1925 1947 1957 1961 2080 2150 2352 2398 2407 2716 2728 2791 2797 2804 2918 3035 3037 3072 3088 3361 3363 3421 3471 3873 3927 3932 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 180
1 11 17 34 36 50 60 62 73 110 141 150 161 246 260 266 296 314 317 318 337 339 356 357 367 377 380 440 457 480 497 500 508 524 527 529 539 551 553 587 588 589 590 593 594 608 648 678 736 745 858 899 908 913 919 920 923 953 957 978 1023 1035 1036 1042 1059 1097 1101 1136 1172 1193 1196 1197 1198 1200 1203 1207 1210 1214 1223 1225 1231 1233 1234 1240 1242 1246 1250 1253 1259 1265 1266 1269 1270 1272 1276 1278 1282 1287 1291 1294 1301 1302 1304 1307 1348 1356 1358 1374 1387 1393 1396 1408 1537 1544 1580 1584 1610 1617 1641 1653 1663 1674 1682 1693 1704 1721 1784 1797 1873 1907 1917 1923 1947 1954 1957 1961 2028 2070 2080 2150 2268 2297 2302 2321 2324 2329 2336 2352 2359 2396 2398 2407 2424 2501 2571 2671 2686 2692 2716 2761 2762 2788 2791 2797 2804 2841 2858 2905 2918 2997 3006 3035 3037 3060 3072 3081 3088 3095 3114 3147 3148 3155 3159 3173 3175 3178 3185 3189 3247 3252 3255 3256 3298 3363 3404 3408 3421 3450 3471 3481 3510 3512 3513 3534 3536 3578 3615 3624 3699 3751 3753 3827 3852 3873 3897 3911 3916 3928 3948 3952 
Solution for Two pass algorithm (greedy) for rank = 180
1 5 11 12 18 23 25 26 29 30 34 35 36 42 43 44 45 48 50 55 56 58 61 62 69 70 73 77 78 82 87 89 93 97 101 104 107 108 110 113 122 124 126 130 135 142 147 150 177 196 253 260 317 318 356 440 457 480 500 524 527 539 587 588 589 590 593 594 678 745 858 899 908 913 919 920 923 953 1023 1035 1036 1042 1097 1101 1136 1172 1193 1196 1197 1198 1200 1203 1207 1210 1214 1225 1231 1233 1234 1240 1242 1246 1250 1253 1259 1265 1266 1269 1270 1272 1276 1278 1282 1287 1291 1294 1301 1302 1304 1307 1356 1374 1387 1393 1408 1580 1584 1610 1617 1663 1674 1682 1704 1721 1784 1873 1923 1925 1947 1954 1957 1961 2028 2070 2080 2150 2302 2321 2324 2336 2352 2359 2396 2398 2407 2424 2501 2571 2671 2716 2761 2762 2788 2791 2797 2804 2858 2905 2918 3022 3035 3037 3072 3088 3095 3114 3147 3148 3155 3159 3175 3189 3255 3309 3363 3404 3408 3421 3471 3510 3512 3536 3578 3624 3629 3751 3753 3827 3852 3873 3897 3916 3928 3948 3952 
Variance in % for rank = 180 0.00495317
Variance in % for rank = 180 0.00641338
Variance in % for rank = 180 0.0048403
Variance in % for rank = 190 0.0500948
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 190
1 3 4 5 6 7 8 9 10 11 12 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 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 82 83 84 86 87 88 89 90 92 93 94 95 96 97 99 101 102 104 106 107 108 109 110 113 114 115 117 118 119 120 121 122 124 125 126 127 129 130 133 135 138 139 141 142 143 144 145 147 148 150 151 152 154 168 173 177 188 196 204 210 220 253 273 541 775 841 1035 1302 1294 1276 3035 1947 1231 1272 1292 1207 1198 260 1262 1172 909 2804 3037 2150 1256 1301 1299 1097 953 1234 2728 2352 1270 1663 1957 3504 1253 919 1193 1303 2797 1242 1283 1961 3088 3873 1254 1240 2788 3471 1196 899 858 1278 1307 2300 3508 1259 910 1269 1203 1293 590 1036 1136 3363 3359 1246 3095 3361 1225 2716 3360 1610 1674 2407 920 1210 1200 2915 1233 1291 1079 955 2918 1376 923 1282 3928 2398 913 1348 1925 978 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 190
1 3 4 5 6 7 8 9 10 11 12 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 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 82 83 84 86 87 88 89 90 92 93 94 95 96 97 99 101 102 104 106 107 108 109 110 113 114 115 117 118 119 120 121 122 124 125 126 127 129 130 133 135 138 139 141 142 143 144 145 147 148 150 151 152 154 168 173 177 188 196 204 210 220 253 260 273 541 587 590 594 775 841 858 899 904 908 912 913 919 920 923 953 955 957 1035 1036 1073 1097 1101 1136 1172 1193 1196 1197 1198 1200 1203 1207 1210 1214 1225 1231 1233 1234 1240 1242 1246 1250 1259 1269 1270 1272 1276 1278 1282 1292 1293 1294 1299 1301 1302 1304 1307 1348 1374 1387 1610 1663 1674 1925 1947 1957 1961 2080 2150 2352 2398 2407 2716 2728 2791 2797 2804 2918 3035 3037 3072 3088 3095 3361 3363 3421 3471 3873 3927 3928 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 190
1 11 17 34 36 50 60 62 73 110 141 150 161 246 260 266 293 296 314 317 318 337 339 356 357 367 377 380 440 457 480 497 500 508 524 527 529 539 551 553 587 588 589 590 593 594 608 648 678 736 745 858 899 908 912 913 919 920 923 953 955 957 978 1023 1035 1036 1042 1059 1097 1101 1136 1172 1193 1196 1197 1198 1200 1203 1207 1210 1214 1223 1225 1231 1233 1234 1240 1242 1246 1250 1253 1259 1265 1266 1269 1270 1272 1276 1278 1282 1287 1291 1293 1294 1301 1302 1304 1307 1348 1356 1358 1374 1387 1393 1396 1408 1537 1544 1580 1584 1610 1617 1641 1653 1663 1674 1682 1693 1694 1704 1721 1784 1797 1873 1907 1917 1923 1947 1954 1957 1961 2028 2070 2080 2150 2268 2297 2302 2321 2324 2329 2336 2352 2353 2359 2396 2398 2407 2424 2501 2571 2671 2686 2692 2716 2761 2762 2788 2791 2797 2804 2841 2858 2905 2918 2959 2997 3006 3035 3037 3060 3072 3081 3088 3095 3108 3114 3147 3148 3155 3159 3173 3175 3178 3185 3189 3247 3252 3255 3256 3298 3361 3363 3404 3408 3421 3450 3471 3481 3510 3512 3513 3534 3536 3555 3578 3615 3624 3699 3751 3753 3809 3827 3852 3873 3897 3911 3916 3927 3928 3948 3952 
Solution for Two pass algorithm (greedy) for rank = 190
1 5 11 12 18 23 25 26 29 30 34 35 36 38 42 43 45 48 50 55 56 58 61 62 69 70 73 74 77 78 82 87 89 93 95 97 101 104 107 108 110 113 118 122 124 126 130 135 142 144 147 150 177 196 253 260 317 318 356 367 440 457 480 500 524 527 539 587 588 589 590 593 594 678 745 775 858 899 908 912 913 919 920 923 953 1023 1035 1036 1042 1097 1101 1136 1172 1193 1196 1197 1198 1200 1203 1207 1210 1214 1225 1231 1233 1234 1240 1242 1246 1250 1253 1259 1265 1266 1269 1270 1272 1276 1278 1282 1287 1291 1293 1294 1301 1302 1304 1307 1356 1374 1387 1393 1408 1580 1584 1610 1617 1663 1674 1682 1704 1721 1784 1873 1923 1925 1947 1954 1957 1961 2028 2070 2080 2150 2302 2321 2324 2336 2352 2359 2366 2396 2398 2407 2424 2501 2571 2671 2716 2761 2762 2788 2791 2797 2804 2858 2905 2918 3022 3035 3037 3072 3088 3095 3114 3147 3148 3155 3159 3175 3178 3189 3255 3309 3363 3404 3408 3421 3471 3510 3512 3536 3555 3578 3615 3624 3629 3699 3751 3753 3827 3852 3873 3897 3916 3928 3948 3952 
Variance in % for rank = 190 0.00453896
Variance in % for rank = 190 0.00546827
Variance in % for rank = 190 0.00440997
Variance in % for rank = 200 0.0490397
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 200
1 3 4 5 6 7 8 9 10 11 12 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 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 82 83 84 86 87 88 89 90 92 93 94 95 96 97 99 101 102 104 106 107 108 109 110 113 114 115 117 118 119 120 121 122 124 125 126 127 129 130 133 135 138 139 141 142 143 144 145 147 148 150 151 152 154 156 159 168 173 177 188 196 204 210 220 253 273 285 303 311 316 328 1035 1302 1294 1276 3035 1947 1231 1198 260 1272 1207 1292 1262 909 2804 1172 3037 1256 2150 1097 1299 953 1234 1301 2728 2352 1270 1193 3504 919 1957 1663 1253 1961 1283 1303 1242 2797 858 1196 3088 3873 1254 1240 3471 899 2788 1278 2300 1307 910 1269 1259 1203 3508 1293 1036 1136 3363 1304 3359 1246 3095 1225 1287 1235 3361 2716 1210 3360 920 1610 1200 1674 2407 2019 1233 2915 1374 1291 1079 955 2918 3072 923 1101 1282 2872 2000 2398 913 2018 1348 1925 978 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 200
1 3 4 5 6 7 8 9 10 11 12 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 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 82 83 84 86 87 88 89 90 92 93 94 95 96 97 99 101 102 104 106 107 108 109 110 113 114 115 117 118 119 120 121 122 124 125 126 127 129 130 133 135 138 139 141 142 143 144 145 147 148 150 151 152 154 156 159 168 173 177 188 196 204 210 220 253 260 273 285 303 311 316 328 587 590 594 858 899 904 908 912 913 919 920 923 953 955 1028 1035 1036 1073 1079 1097 1101 1136 1172 1193 1196 1197 1198 1200 1203 1207 1210 1214 1219 1225 1231 1233 1234 1240 1242 1246 1250 1253 1259 1269 1270 1272 1276 1278 1282 1291 1292 1293 1294 1299 1301 1302 1304 1307 1348 1374 1387 1610 1663 1674 1925 1947 1957 1961 2000 2080 2150 2352 2398 2407 2716 2728 2791 2797 2804 2918 3035 3037 3072 3088 3095 3361 3363 3421 3471 3629 3671 3873 3927 3928 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 200
1 11 17 34 36 50 60 62 73 110 141 150 161 246 260 266 293 296 314 317 318 337 339 356 357 367 377 380 440 457 480 497 500 508 524 527 529 539 551 553 587 588 589 590 593 594 595 608 648 678 736 745 780 858 899 908 912 913 919 920 923 953 955 957 978 1023 1035 1036 1042 1059 1073 1079 1097 1101 1136 1172 1193 1196 1197 1198 1200 1203 1207 1210 1214 1223 1225 1231 1233 1234 1240 1242 1246 1250 1253 1259 1265 1266 1269 1270 1271 1272 1276 1278 1282 1287 1291 1293 1294 1301 1302 1304 1307 1348 1356 1358 1374 1387 1393 1396 1408 1537 1544 1580 1584 1610 1617 1641 1653 1663 1674 1682 1693 1694 1704 1721 1784 1797 1873 1907 1914 1917 1923 1947 1954 1957 1961 2000 2019 2028 2070 2080 2150 2268 2297 2302 2321 2324 2329 2336 2352 2353 2359 2396 2398 2407 2424 2501 2571 2671 2686 2692 2716 2761 2762 2788 2791 2797 2804 2826 2841 2858 2905 2918 2959 2997 3006 3035 3037 3060 3072 3081 3088 3095 3108 3114 3147 3148 3155 3159 3173 3175 3178 3185 3189 3247 3252 3255 3256 3298 3301 3361 3363 3404 3408 3421 3450 3471 3481 3510 3512 3513 3534 3536 3554 3555 3578 3615 3624 3699 3751 3753 3809 3827 3873 3897 3911 3916 3927 3928 3948 3949 3952 
Solution for Two pass algorithm (greedy) for rank = 200
1 5 11 12 18 23 25 26 30 34 35 36 38 42 43 45 48 50 55 56 58 61 62 65 69 70 73 74 77 78 82 87 89 93 95 97 101 104 107 108 110 113 118 122 124 126 130 135 142 144 147 150 159 177 196 253 260 303 317 318 328 356 367 440 457 480 500 524 527 539 587 588 589 590 593 594 595 608 678 745 780 858 899 908 912 913 919 920 923 953 1023 1035 1036 1042 1073 1097 1101 1136 1172 1193 1196 1197 1198 1200 1203 1207 1210 1214 1225 1231 1233 1234 1240 1242 1246 1250 1253 1259 1265 1266 1269 1270 1272 1276 1278 1282 1287 1291 1293 1294 1301 1302 1304 1307 1356 1374 1387 1393 1408 1580 1584 1610 1617 1663 1674 1682 1704 1721 1784 1873 1923 1925 1947 1954 1957 1961 2000 2019 2028 2070 2080 2150 2302 2321 2324 2336 2352 2359 2366 2396 2398 2407 2424 2501 2571 2671 2716 2761 2762 2788 2791 2797 2804 2858 2905 2918 3022 3035 3037 3072 3088 3095 3114 3147 3148 3155 3159 3175 3178 3189 3255 3309 3361 3363 3404 3408 3421 3471 3510 3512 3536 3555 3578 3615 3624 3629 3699 3751 3753 3827 3873 3897 3911 3916 3927 3928 3948 3952 
Variance in % for rank = 200 0.00566051
Variance in % for rank = 200 0.00881072
Variance in % for rank = 200 0.00580187
