{"id":"W2952164293","doi":"10.48550/arxiv.1204.4526","title":"A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Submodular set function; Matroid; Mathematics; Greedy algorithm; Combinatorics; Monotone polygon; Approximation algorithm; Randomized rounding; Rounding; Matroid partitioning; Weighted matroid; Maximization; Discrete mathematics; Constraint (computer-aided design); Function (biology); Algorithm; Mathematical optimization; Computer science; Graphic matroid","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001518895,0.002228815,0.001792418,0.001334275,0.000808728,0.00235583,0.003162088,0.00239869,0.01381805],"category_scores_gemma":[0.006601613,0.001049126,0.001775982,0.002401473,0.001190259,0.00360977,0.003349697,0.003725354,0.004905068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002124689,"about_ca_system_score_gemma":0.003202894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002831185,"about_ca_topic_score_gemma":0.004493371,"domain_scores_codex":[0.9980556,0.0003994246,0.0001021277,0.0005038145,0.000625681,0.000313426],"domain_scores_gemma":[0.998279,0.0007809994,0.0001594743,0.0004900681,0.0001753706,0.0001151094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003812584,0.000575213,0.0009513347,0.0005680763,0.0001358835,0.000216167,0.000242554,0.2608161,0.009924463,0.1390557,0.03741066,0.5497226],"study_design_scores_gemma":[0.0001895623,0.0001376697,0.000232468,0.00004111792,0.00003182104,0.0002358007,0.00006973879,0.9065372,0.002389489,0.0825436,0.007559038,0.00003248365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005251597,0.0002551861,0.9847239,0.0004353874,0.00007854587,0.0002001172,0.0001768813,0.001975491,0.006902847],"genre_scores_gemma":[0.07338578,0.0002012815,0.9216983,0.0003698325,0.0001085359,0.0004030775,0.0005507749,0.0003922078,0.002890174],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01381805,"threshold_uncertainty_score":0.04622602,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06039290440074062,"score_gpt":0.1978504408056005,"score_spread":0.1374575364048599,"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."}}