{"id":"W2963782874","doi":"10.4230/lipics.icalp.2017.55","title":"Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Approximation algorithm; Combinatorics; Matroid; Discrete mathematics; Rounding; Polynomial-time approximation scheme; Vertex (graph theory); Linear programming relaxation; Knapsack problem; Graph; Mathematical optimization; Linear programming; 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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007538903,0.0003102028,0.0003599745,0.0002283804,0.001261298,0.001797452,0.001318672,0.0001660675,0.00003111794],"category_scores_gemma":[0.0001381812,0.000277792,0.0001809637,0.00009836003,0.0003594432,0.002442471,0.0004326076,0.0002148609,0.00003404313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003573206,"about_ca_system_score_gemma":0.00008043136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008087537,"about_ca_topic_score_gemma":0.00001296236,"domain_scores_codex":[0.9979417,0.00003076818,0.0007398245,0.0003069787,0.0003368981,0.0006437927],"domain_scores_gemma":[0.9977462,0.0001516081,0.0005230386,0.0009964774,0.0003173744,0.0002652599],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002403901,0.0009751459,0.0123099,0.003640092,0.0007725988,0.000008881741,0.06531122,0.001039033,0.0005035065,0.8052016,0.01255957,0.09743803],"study_design_scores_gemma":[0.01168068,0.0004847954,0.004210563,0.000278202,0.00006647701,0.0001294807,0.002197837,0.879648,0.0007160621,0.0688839,0.03039327,0.001310667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02643255,0.0000271505,0.9629241,0.001702987,0.0004469621,0.002119357,0.0003943607,0.0001786093,0.005773899],"genre_scores_gemma":[0.703766,0.00004469073,0.2942514,0.0007520697,0.00006017308,0.0002980637,0.0001683948,0.00003652877,0.0006227394],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.878609,"threshold_uncertainty_score":0.9999674,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02349403411633295,"score_gpt":0.2828776831977924,"score_spread":0.2593836490814594,"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."}}