{"id":"W2009786555","doi":"10.1109/focs.2012.55","title":"A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint","year":2012,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Matroid; Submodular set function; Greedy algorithm; Monotone polygon; Mathematics; Rounding; Function (biology); Combinatorics; Constraint (computer-aided design); Mathematical optimization; Approximation algorithm; Algorithm; Discrete mathematics; Combinatorial optimization; Computer science","routes":{"ca_aff":true,"ca_fund":false,"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.000484269,0.0001647768,0.0001911805,0.0001565611,0.0001879533,0.0001601047,0.0005954255,0.00006923003,0.00005621074],"category_scores_gemma":[0.00004440757,0.000154243,0.0001191675,0.0004622023,0.00004705379,0.0004973261,0.0002060812,0.00008141641,0.00006069441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005081471,"about_ca_system_score_gemma":0.00005011089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002480297,"about_ca_topic_score_gemma":0.00000301697,"domain_scores_codex":[0.9986137,0.00004859232,0.0002323122,0.0003157478,0.000264316,0.0005253524],"domain_scores_gemma":[0.9990174,0.000112312,0.00005208201,0.0004326769,0.0001302138,0.0002553235],"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.000006503682,0.000179579,0.0001393414,0.000009340079,0.00002228147,0.000001576609,0.0004125242,0.00001719462,0.0001479424,0.8206581,0.002700902,0.1757047],"study_design_scores_gemma":[0.003689614,0.0008135448,0.002207545,0.00004100688,0.00003793946,0.0001390911,0.0001400202,0.6412547,0.01632137,0.1911978,0.142777,0.001380434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001180748,0.00004202871,0.9932595,0.000714822,0.002749745,0.0005768317,0.00001583901,0.000264419,0.001196084],"genre_scores_gemma":[0.1211408,0.000002640804,0.8774132,0.0006229521,0.0005210954,0.00009956475,0.00001233306,0.00001363239,0.0001737541],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6412374,"threshold_uncertainty_score":0.6289847,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01981169866179729,"score_gpt":0.2545320422452528,"score_spread":0.2347203435834555,"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."}}