{"id":"W3178051994","doi":"10.3934/jimo.2021116","title":"Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem","year":2021,"lang":"en","type":"article","venue":"Journal of Industrial and Management Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Steiner tree problem; Stochastic optimization; Mathematical optimization; Computer science; Stochastic programming; Tree (set theory); Constant (computer programming); Approximation algorithm; Optimization problem; Mathematics; Combinatorics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004312823,0.0001048389,0.0001798292,0.0001781343,0.0001859974,0.0002870722,0.0001461968,0.00004829835,0.000005188496],"category_scores_gemma":[0.00004325786,0.00008374335,0.0000452829,0.0005176006,0.00002674639,0.0005489747,0.00007761623,0.0001126192,9.702817e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003879951,"about_ca_system_score_gemma":0.00009762769,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001019447,"about_ca_topic_score_gemma":0.00000173189,"domain_scores_codex":[0.9990005,0.00005126873,0.0003771913,0.0001744076,0.0002624237,0.0001342147],"domain_scores_gemma":[0.999036,0.00007775077,0.0003796097,0.0001055816,0.0003470722,0.00005404044],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001250507,0.0002015902,0.00001611334,0.00007024975,0.0002575885,0.00003353446,0.0003508871,0.4379429,0.0000327616,0.05695935,0.0009232044,0.5030868],"study_design_scores_gemma":[0.003714781,0.0004191294,0.000006287879,0.0002180988,0.00008440432,0.00009060157,0.0002528615,0.9911386,0.0001752594,0.003207178,0.0005502923,0.0001425256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001067844,0.00006139516,0.9976434,0.0008756886,0.0002890924,0.0004782616,0.000002189646,0.00001877647,0.0005243724],"genre_scores_gemma":[0.002752034,0.00005993262,0.996583,0.00006604176,0.0002120375,0.00002050331,0.00000842154,0.000007364939,0.000290693],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5531957,"threshold_uncertainty_score":0.3414955,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03790861511359168,"score_gpt":0.2395858142667586,"score_spread":0.201677199153167,"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."}}