{"id":"W4288734880","doi":"10.1016/j.tcs.2022.07.029","title":"Improved algorithms for non-submodular function maximization problem","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Submodular set function; Cardinality (data modeling); Maximization; Mathematical optimization; Monotone polygon; Mathematics; Constraint (computer-aided design); Function (biology); Greedy algorithm; Set function; Computer science; Set (abstract data type)","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.002671391,0.001937739,0.002256943,0.001469057,0.0009511268,0.002588114,0.004808103,0.002348655,0.01308477],"category_scores_gemma":[0.009698653,0.0009065968,0.001690642,0.002813173,0.001037317,0.005256986,0.003112886,0.004707704,0.002925836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002162644,"about_ca_system_score_gemma":0.002834609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003746444,"about_ca_topic_score_gemma":0.006122566,"domain_scores_codex":[0.9977683,0.0007782459,0.0001160845,0.0004774324,0.0005718708,0.0002881279],"domain_scores_gemma":[0.9949569,0.003049809,0.0002376051,0.0009341367,0.0006383827,0.0001832793],"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.0005973566,0.0007446911,0.001081892,0.0007180075,0.000175826,0.0001385824,0.0002497535,0.3161687,0.004347243,0.1257933,0.03504476,0.5149397],"study_design_scores_gemma":[0.0001060662,0.0000531714,0.0002680301,0.00002752134,0.00003677817,0.00006947906,0.00003086583,0.9215988,0.001022783,0.07289799,0.003871071,0.00001746699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007324344,0.0005524388,0.985409,0.0004172877,0.0001637355,0.0001180968,0.0001668537,0.0009106908,0.004937606],"genre_scores_gemma":[0.0940563,0.000427096,0.8966562,0.0003940669,0.0002715911,0.0004129055,0.0008552439,0.0005798306,0.006346709],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01308477,"threshold_uncertainty_score":0.04377294,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01349457095247311,"score_gpt":0.2375044258966565,"score_spread":0.2240098549441834,"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."}}