111
Optimal Verification of a Minimum-Weight Basis in an Uncertainty Matroid
arXiv:2512.17116v1 Announce Type: new
Abstract: Research in explorable uncertainty addresses combinatorial optimization problems where there is partial information about the values of numeric input parameters, and exact values of these parameters can be determined by performing costly queries. The …
Abstract: Research in explorable uncertainty addresses combinatorial optimization problems where there is partial information about the values of numeric input parameters, and exact values of these parameters can be determined by performing costly queries. The …