{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001004946,0.0001602432,0.0002864659,0.0005260358,0.0003503852,0.0002629106,0.0005680652,0.00008153617,0.000008878238],"category_scores_gemma":[0.0002736264,0.0001567633,0.0002120404,0.001428081,0.00004030275,0.001355038,0.0001151639,0.0002141494,0.00001129647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001192374,"about_ca_system_score_gemma":0.0001694287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004383276,"about_ca_topic_score_gemma":3.842123e-7,"domain_scores_codex":[0.9983308,0.0001107523,0.000611462,0.0002214253,0.0004617734,0.0002637866],"domain_scores_gemma":[0.9978317,0.0003529368,0.0006297893,0.0002489886,0.0008317832,0.0001048134],"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.00008163716,0.0001447193,0.00002009179,0.00002700432,0.000100873,0.000007728849,0.0008840938,0.8050647,0.0001639768,0.177502,0.002584842,0.01341828],"study_design_scores_gemma":[0.002045766,0.0003567477,0.00004669327,0.00004148191,0.00002967647,0.00002475453,0.0001493842,0.9122912,0.0005495517,0.08317757,0.001122651,0.0001644653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007992942,0.00003178054,0.9894461,0.001032766,0.007886829,0.000345171,0.00001016873,0.0001350535,0.0003128177],"genre_scores_gemma":[0.0793534,0.00008318036,0.9190154,0.00007203625,0.001232264,0.0000496994,0.00004571533,0.00003169722,0.0001166164],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1072266,"threshold_uncertainty_score":0.6392621,"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."}}