{"id":"W3185873601","doi":"10.1007/s10878-021-00753-x","title":"Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"Qinglan Project of Jiangsu Province of China; Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Set cover problem; Mathematical optimization; Cover (algebra); Computer science; Stochastic programming; Approximation algorithm; Set (abstract data type); Covering problems; Stochastic optimization; Theory of computation; Optimization problem; Combinatorial optimization; Knapsack problem; Vertex cover; Mathematics; Algorithm","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.0004392854,0.0001489081,0.0002920422,0.0001448506,0.0001823208,0.0003411185,0.0002637386,0.00007897685,0.00001643742],"category_scores_gemma":[0.0002530751,0.0001206994,0.00007667223,0.000490649,0.00005153951,0.0009937672,0.00008294306,0.0001516428,6.052121e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007611344,"about_ca_system_score_gemma":0.0002362959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001470949,"about_ca_topic_score_gemma":3.337991e-7,"domain_scores_codex":[0.9986032,0.00009556595,0.0004270648,0.0002270408,0.0004617921,0.0001853812],"domain_scores_gemma":[0.9979757,0.0002158726,0.0004726867,0.0002135265,0.001010224,0.0001119591],"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.0008037504,0.0009771821,0.00005269411,0.0001521776,0.0002317819,0.0000957982,0.001376804,0.9025235,0.0006988055,0.07677143,0.001052931,0.01526312],"study_design_scores_gemma":[0.003908475,0.001262378,0.00004187158,0.0001278476,0.00006278907,0.0003681635,0.00005962603,0.9667606,0.001581334,0.02506514,0.00053638,0.0002254273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002738761,0.0001456542,0.9943435,0.0005297002,0.001964447,0.0002042169,0.000005746236,0.00002467138,0.00004327705],"genre_scores_gemma":[0.1723447,0.000041178,0.8268877,0.00009189922,0.0005116374,0.000008150143,0.00002535621,0.00002026109,0.00006905685],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.169606,"threshold_uncertainty_score":0.4921978,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03104711897350986,"score_gpt":0.2593955644821698,"score_spread":0.22834844550866,"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."}}