{"id":"W4315641735","doi":"10.1007/s10878-022-00978-4","title":"Two approximation algorithms for maximizing nonnegative weakly monotonic set functions","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Mathematics; Monotone polygon; Approximation algorithm; Monotonic function; Combinatorics; Greedy algorithm; Theory of computation; Maximization; Set function; Set (abstract data type); Discrete mathematics; Function (biology); Mathematical optimization; Algorithm; Computer science; Mathematical analysis","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007313938,0.003014542,0.003567094,0.002401878,0.001328103,0.004847298,0.007390582,0.005154307,0.005167897],"category_scores_gemma":[0.02894962,0.001629014,0.003023245,0.003882228,0.002600848,0.007106091,0.005832007,0.00602922,0.001073149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00487047,"about_ca_system_score_gemma":0.003624173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002602,"about_ca_topic_score_gemma":0.003107034,"domain_scores_codex":[0.9956285,0.002048889,0.0002236703,0.0006709441,0.0008895621,0.0005384375],"domain_scores_gemma":[0.9887753,0.007479656,0.0005627464,0.001427501,0.00108218,0.0006727043],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001306345,0.0006202451,0.002118471,0.000519129,0.0002028043,0.0001307958,0.0005745549,0.2968599,0.003256763,0.369164,0.01453883,0.3107081],"study_design_scores_gemma":[0.0001225201,0.0001203394,0.0002778024,0.00005578783,0.00006834511,0.0001042622,0.00006904346,0.8749598,0.001216543,0.1210771,0.001894336,0.00003406766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01923937,0.0007683588,0.9730179,0.0011026,0.0001743454,0.000177013,0.0001396974,0.0004292394,0.004951491],"genre_scores_gemma":[0.2298479,0.0008140805,0.7582572,0.0005862484,0.0003334687,0.0005934726,0.0005495253,0.0003608842,0.008657227],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007390582,"threshold_uncertainty_score":0.03868026,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03909375940252006,"score_gpt":0.2958453431144178,"score_spread":0.2567515837118977,"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."}}