{"id":"W2611727281","doi":"10.1007/s40305-017-0164-4","title":"A Primal-Dual Algorithm for the Generalized Prize-Collecting Steiner Forest Problem","year":2017,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Combinatorics; Steiner tree problem; Mathematics; Vertex (graph theory); Graph; Vertex connectivity; Enhanced Data Rates for GSM Evolution; Approximation algorithm; Discrete mathematics; Computer science","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":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004843677,0.0001128865,0.0002280956,0.00006257513,0.005068144,0.001045614,0.003186746,0.00006037326,0.000008817118],"category_scores_gemma":[0.0005517695,0.00005935365,0.0005733344,0.0003591427,0.000502449,0.000760679,0.0008923236,0.0006780273,6.226164e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008252394,"about_ca_system_score_gemma":0.0006252789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001822177,"about_ca_topic_score_gemma":0.00008347454,"domain_scores_codex":[0.9977775,0.000239502,0.0004639397,0.0001720686,0.001006557,0.0003404554],"domain_scores_gemma":[0.9971098,0.0004463788,0.0002993405,0.0008962786,0.001173379,0.00007480317],"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.0001480987,0.001751491,0.001371557,0.0003479659,0.002430004,0.00001054967,0.04533008,0.0760344,0.02068855,0.1699912,0.1818868,0.5000093],"study_design_scores_gemma":[0.001319996,0.0002841986,0.004592691,0.0001071774,0.00002077226,0.00006201323,0.0002434221,0.9681935,0.002059927,0.01649215,0.006517597,0.0001065501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03244327,0.0005098702,0.9074828,0.05708371,0.0006634954,0.001364225,0.00001975031,0.00001463031,0.0004182419],"genre_scores_gemma":[0.1129115,0.0002598702,0.8827364,0.0001320246,0.0006948293,0.00005617043,6.730162e-7,0.00001535533,0.003193196],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8921591,"threshold_uncertainty_score":0.9999914,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09638973414503361,"score_gpt":0.3840629623885448,"score_spread":0.2876732282435112,"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."}}