{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005937868,0.004390602,0.008719405,0.00278992,0.001863769,0.005391447,0.008923289,0.006236762,0.01877843],"category_scores_gemma":[0.02087494,0.003083812,0.003877046,0.006264162,0.002770544,0.01075191,0.004525425,0.00697179,0.002414805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006561694,"about_ca_system_score_gemma":0.00570588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008933728,"about_ca_topic_score_gemma":0.01310412,"domain_scores_codex":[0.9959933,0.001535827,0.0001615799,0.0007791867,0.0006758119,0.0008543255],"domain_scores_gemma":[0.9855288,0.01096384,0.000795516,0.001213422,0.0006100576,0.0008884137],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006347246,0.0006062259,0.001185956,0.0004754757,0.0002134737,0.000127054,0.0001534643,0.8762539,0.0005343057,0.05504263,0.017855,0.04691783],"study_design_scores_gemma":[0.0000705672,0.00005045091,0.00007275706,0.00002356327,0.00002793782,0.00003129137,0.0000314671,0.9659598,0.0001065446,0.03305832,0.0005572538,0.000009899948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06295586,0.003381952,0.9088555,0.004484762,0.0004824292,0.0007548388,0.002295337,0.00194699,0.01484232],"genre_scores_gemma":[0.5381927,0.001908642,0.4325301,0.001564774,0.0007512481,0.001428223,0.003745724,0.001200643,0.01867785],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01877843,"threshold_uncertainty_score":0.06282014,"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."}}