{"id":"W3131144142","doi":"10.1016/j.orl.2021.09.006","title":"Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid","year":2021,"lang":"en","type":"preprint","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Matroid; Automatic summarization; Heuristics; Greedy algorithm; Computer science; Set function; Set (abstract data type); Mathematical optimization; Submodular set function; Weighted matroid; Algorithm; Mathematics; Discrete mathematics; Artificial intelligence; Matroid partitioning; 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.003712972,0.002237323,0.001773036,0.0008165864,0.0006451849,0.001923164,0.002501107,0.001892322,0.002071487],"category_scores_gemma":[0.01742679,0.0005595712,0.0008788343,0.001492943,0.0014343,0.002715884,0.002061858,0.001814789,0.0006263732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002217315,"about_ca_system_score_gemma":0.001967932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001621185,"about_ca_topic_score_gemma":0.001542492,"domain_scores_codex":[0.9975938,0.001149205,0.00008205918,0.0003540941,0.0004557403,0.0003650898],"domain_scores_gemma":[0.988961,0.008079789,0.0008011698,0.001018984,0.0006462964,0.0004926179],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009368425,0.0002081048,0.001351651,0.0002575984,0.00009578579,0.00007099748,0.0001497268,0.8699725,0.00678628,0.05269704,0.004428252,0.06304526],"study_design_scores_gemma":[0.00003433112,0.0001324435,0.0002081507,0.00001042453,0.00001181866,0.000034883,0.00003382279,0.9787793,0.001721353,0.01870706,0.0003169935,0.000009453339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1795231,0.001509263,0.8063606,0.001276818,0.00008458898,0.0001691108,0.0003345441,0.0007870312,0.009954944],"genre_scores_gemma":[0.8386102,0.001062168,0.1561814,0.0003746306,0.0001173223,0.0002521866,0.0005343042,0.0002926186,0.002575137],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003712972,"threshold_uncertainty_score":0.01963627,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0882885469965528,"score_gpt":0.3374389446826125,"score_spread":0.2491503976860597,"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."}}