Variance in % for rank = 25 0.0606491
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 25
2 3 4 5 9 10 17 19 26 31 37 49 50 55 56 65 93 111 140 195 200 369 413 478 1508 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 25
2 3 4 5 9 10 17 19 26 31 37 49 50 55 56 65 93 111 140 195 200 369 413 478 1508 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 25
31 103 190 334 506 584 599 651 708 745 1431 1988 2204 2218 2627 2707 2990 3274 3365 3701 3874 4017 4033 4226 4377 
Solution for Two pass algorithm (greedy) for rank = 25
2 4 5 9 19 26 31 37 55 111 140 413 651 708 745 985 1186 1988 2371 2627 3274 3495 3556 3701 4033 
Variance in % for rank = 25 0.0134473
Variance in % for rank = 25 0.0301027
Variance in % for rank = 25 0.0239466
Variance in % for rank = 30 0.0367275
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 30
3 4 5 6 9 10 17 19 26 31 37 49 50 55 56 61 65 76 93 111 118 124 130 140 195 200 369 393 478 689 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 30
3 4 5 6 9 10 17 19 26 31 37 49 50 55 56 61 65 76 93 111 118 124 130 140 195 200 369 393 478 689 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 30
31 190 334 506 599 651 708 745 1186 1258 1306 1431 1521 1988 2019 2204 2218 2407 2627 2707 2990 3274 3365 3587 3701 3854 4017 4033 4226 4259 
Solution for Two pass algorithm (greedy) for rank = 30
4 10 17 50 56 65 93 118 130 334 369 478 506 584 651 708 745 1431 1988 2204 2218 2407 2627 2707 3274 3365 3701 4017 4377 
Variance in % for rank = 30 0.0149777
Variance in % for rank = 30 0.0285083
Variance in % for rank = 30 0.0607319
Variance in % for rank = 35 0.0341318
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 35
1 2 3 4 5 6 9 10 12 17 19 26 31 50 55 56 65 76 93 111 118 130 140 195 200 369 393 413 478 689 3701 1508 1275 660 2371 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 35
1 2 3 4 5 6 9 10 12 17 19 26 31 50 55 56 65 76 93 111 118 130 140 195 200 369 393 413 478 689 1508 2399 3701 3828 3854 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 35
31 190 334 506 599 651 708 745 847 1186 1306 1431 1521 1960 1988 2019 2204 2218 2627 2683 2707 2990 3274 3365 3398 3466 3587 3701 3854 4017 4033 4226 4259 4463 4518 
Solution for Two pass algorithm (greedy) for rank = 35
2 4 10 17 26 50 65 93 118 190 200 334 369 478 506 651 708 745 1186 1306 1431 1521 1988 2204 2218 2229 2407 2627 2707 3274 3365 3701 3854 4017 4033 
Variance in % for rank = 35 0.00619125
Variance in % for rank = 35 0.00879201
Variance in % for rank = 35 0.00638584
Variance in % for rank = 40 0.031947
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 40
1 2 3 4 5 6 7 9 10 12 17 19 26 31 50 55 56 61 65 76 93 95 111 118 130 140 162 195 200 369 393 413 448 478 689 1313 1508 1275 2371 660 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 40
1 2 3 4 5 6 7 9 10 12 17 19 26 31 50 55 56 61 65 76 93 95 111 118 130 140 162 195 200 369 393 413 448 478 689 1313 1508 2399 3565 3854 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 40
31 190 334 479 506 599 651 708 745 847 960 1186 1306 1431 1521 1777 1960 1988 2019 2204 2218 2255 2627 2683 2707 2990 3230 3274 3365 3398 3466 3587 3701 3854 4017 4033 4226 4259 4463 4518 
Solution for Two pass algorithm (greedy) for rank = 40
1 3 5 6 9 12 19 31 55 56 76 111 130 140 162 393 413 506 599 651 689 708 745 985 1413 1508 1988 2019 2111 2371 2600 2627 2990 3274 3495 3701 3854 4033 4226 4259 
Variance in % for rank = 40 0.00938084
Variance in % for rank = 40 0.0113787
Variance in % for rank = 40 0.00950862
Variance in % for rank = 45 0.0307972
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 45
1 2 3 4 5 6 7 9 10 12 14 17 19 26 31 50 55 56 61 65 76 93 95 111 118 130 140 162 200 301 369 393 413 448 478 689 3701 2990 1484 1508 2371 1275 660 4233 2218 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 45
1 2 3 4 5 6 7 9 10 12 14 17 19 26 31 50 55 56 61 65 76 93 95 111 118 130 140 162 200 301 369 393 413 448 478 689 1032 1508 2218 2371 2399 2990 3565 3701 3854 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 45
31 190 242 315 334 404 479 506 599 651 708 745 847 960 1186 1306 1431 1521 1777 1960 1988 2019 2204 2218 2255 2627 2683 2707 2990 3230 3274 3365 3398 3466 3587 3701 3731 3831 3854 4017 4033 4226 4259 4463 4518 
Solution for Two pass algorithm (greedy) for rank = 45
2 4 7 10 17 19 26 50 61 65 95 111 162 190 200 334 369 413 448 506 651 689 708 745 1186 1306 1431 1521 1960 1988 2204 2229 2627 2707 2990 3274 3365 3398 3701 3854 4017 4033 4226 4259 4518 
Variance in % for rank = 45 0.00253818
Variance in % for rank = 45 0.00321321
Variance in % for rank = 45 0.00227542
Variance in % for rank = 50 0.0306796
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 50
1 2 3 4 5 6 7 8 9 10 12 14 17 19 26 31 50 55 56 61 63 65 76 93 95 104 111 118 130 140 162 195 200 301 369 393 413 448 478 553 689 1313 3701 2990 1508 2371 1275 660 4233 866 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 50
1 2 3 4 5 6 7 8 9 10 12 14 17 19 26 31 50 55 56 61 63 65 76 93 95 104 111 118 130 140 162 195 200 301 369 393 413 448 478 553 689 1032 1313 1508 2371 2399 3565 3701 3854 3977 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 50
31 190 242 315 334 404 479 495 506 599 651 708 745 847 960 1111 1186 1306 1431 1521 1771 1777 1960 1988 2019 2204 2218 2255 2627 2683 2707 2807 2990 3230 3274 3275 3365 3398 3466 3587 3701 3731 3831 4017 4033 4034 4226 4259 4463 4518 
Solution for Two pass algorithm (greedy) for rank = 50
2 4 7 10 17 19 26 31 50 61 65 95 111 162 190 200 334 369 413 448 479 506 599 651 689 708 745 1186 1306 1431 1521 1960 1988 2019 2204 2218 2627 2707 2990 3274 3365 3398 3587 3701 3854 4017 4033 4226 4259 4518 
Variance in % for rank = 50 0.00860409
Variance in % for rank = 50 0.0165519
Variance in % for rank = 50 0.0190027
Variance in % for rank = 55 0.0310532
Solution for Lower bound matroid intersection algorithm (postprocessing=FAST_GREEDY) for rank = 55
1 2 3 4 5 6 7 8 9 10 12 14 16 17 19 26 31 50 55 56 61 65 76 93 95 104 111 118 130 140 162 195 200 301 369 393 413 448 474 478 689 1197 3701 2990 1484 1882 1508 2371 1275 660 4233 866 584 2218 1535 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 55
1 2 3 4 5 6 7 8 9 10 12 14 16 17 19 26 31 50 55 56 61 65 76 93 95 104 111 118 130 140 162 195 200 301 369 393 413 448 474 478 689 1032 1197 1508 1822 2218 2371 2399 2507 2990 3565 3701 3755 3854 3977 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 55
12 31 190 242 315 334 404 479 495 506 599 651 708 745 847 960 1111 1186 1306 1431 1521 1777 1960 1988 2019 2180 2204 2218 2220 2255 2627 2683 2707 2807 2990 3180 3230 3274 3275 3365 3398 3466 3587 3701 3731 3831 4017 4033 4034 4151 4226 4259 4434 4463 4518 
Solution for Two pass algorithm (greedy) for rank = 55
2 4 7 10 16 17 19 31 50 56 65 95 111 162 190 200 334 369 404 413 448 479 506 599 651 689 708 745 847 1186 1306 1431 1521 1960 1988 2019 2204 2218 2255 2627 2683 2707 2990 3274 3365 3398 3466 3587 3701 3854 4017 4033 4226 4259 4518 
Variance in % for rank = 55 0.00229713
Variance in % for rank = 55 0.00353509
Variance in % for rank = 55 0.00301786
Variance in % for rank = 60 0.0283896
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 14 16 17 19 22 26 31 50 55 56 61 65 76 93 95 104 109 111 118 130 140 162 195 197 200 301 369 393 413 448 474 478 520 689 1313 1592 3701 2990 1484 1508 2371 1275 660 4233 866 584 298 2218 
Solution for Lower bound matroid intersection algorithm (postprocessing=GREEDY) for rank = 60
1 2 3 4 5 6 7 8 9 10 11 12 14 16 17 19 22 26 31 50 55 56 61 65 76 93 95 104 109 111 118 130 140 162 195 197 200 301 369 393 413 448 474 478 520 689 1032 1313 1508 1592 2218 2371 2399 2507 2990 3565 3701 3854 3856 3977 
Solution for Upper bound matroid intersection algorithm (greedy) for rank = 60
12 31 190 242 315 334 404 479 495 506 599 651 708 745 847 960 1111 1186 1306 1339 1431 1521 1739 1777 1960 1988 2019 2180 2204 2218 2220 2234 2255 2424 2627 2683 2707 2807 2990 3180 3230 3274 3275 3365 3398 3466 3587 3701 3731 3831 4017 4033 4034 4151 4226 4259 4434 4442 4463 4518 
Solution for Two pass algorithm (greedy) for rank = 60
2 4 7 10 11 16 17 19 26 31 50 61 65 95 109 111 162 190 197 200 315 334 369 404 413 448 479 506 520 599 651 689 708 745 1186 1306 1431 1521 1592 1960 1988 2019 2204 2218 2255 2627 2683 2707 2990 3274 3365 3398 3587 3701 3854 4017 4033 4226 4259 4518 
Variance in % for rank = 60 0.00209312
Variance in % for rank = 60 0.00321062
Variance in % for rank = 60 0.00288603
