{"id":"W2901475388","doi":"10.1007/s10107-020-01524-y","title":"Approximate multi-matroid intersection via iterative refinement","year":2020,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Matroid; Rounding; Matroid partitioning; Mathematics; Weighted matroid; Combinatorics; Knapsack problem; Relaxation (psychology); Polytope; Cardinality (data modeling); Intersection (aeronautics); Mathematical optimization; Discrete mathematics; Graphic matroid; Computer science","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002172923,0.0001349359,0.0001548404,0.00005557084,0.0001240254,0.0002422544,0.0002609575,0.00003743939,0.00003902534],"category_scores_gemma":[0.0001257823,0.0001179135,0.00007232872,0.0003962072,0.00002425673,0.0003276964,0.0001760086,0.0001219815,0.0001614949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004280895,"about_ca_system_score_gemma":0.0000183319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.94075e-7,"about_ca_topic_score_gemma":5.999458e-7,"domain_scores_codex":[0.9988469,0.00005137876,0.0003012353,0.0003341184,0.0002538572,0.0002124974],"domain_scores_gemma":[0.9994708,0.00006857453,0.00008355331,0.0001618407,0.00007798497,0.0001372016],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002472669,0.0005980972,0.00002773935,0.00037975,0.00007639175,0.00002647419,0.01092822,0.001976815,0.0103641,0.210241,0.0004100045,0.7649466],"study_design_scores_gemma":[0.0003199244,0.0001746941,0.000015236,0.00002530996,0.000007682154,0.00001739256,0.00008246265,0.9843763,0.004028781,0.007406012,0.003381367,0.0001648353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002951314,0.00003216836,0.9940331,0.00186324,0.0001009932,0.0003251036,4.790603e-7,0.0002873965,0.0004062275],"genre_scores_gemma":[0.4373325,5.16001e-7,0.5620832,0.000383194,0.00008008278,0.00005439018,0.000006544351,0.000006839026,0.00005273433],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9823995,"threshold_uncertainty_score":0.4808371,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04079817346689619,"score_gpt":0.2750983584804017,"score_spread":0.2343001850135055,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}