{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00210999,0.001393327,0.002410838,0.001163513,0.00129707,0.002248883,0.002945926,0.002043842,0.006892686],"category_scores_gemma":[0.00370143,0.0008790855,0.001109088,0.002298038,0.0009084659,0.002454385,0.002717204,0.002537575,0.0009025868],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001727508,"about_ca_system_score_gemma":0.003626312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002785864,"about_ca_topic_score_gemma":0.004201697,"domain_scores_codex":[0.9989906,0.0003984447,0.00004244928,0.0001885258,0.0001823957,0.0001976347],"domain_scores_gemma":[0.9984977,0.0007601263,0.0001131862,0.0001630501,0.0002299414,0.0002359452],"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.0008892847,0.001034796,0.001531728,0.0006870078,0.000153159,0.0002503326,0.0002159352,0.6451356,0.002921715,0.08767124,0.02633677,0.2331724],"study_design_scores_gemma":[0.0001538608,0.00008336295,0.0002071615,0.00002750379,0.00003158644,0.0001201678,0.00006059638,0.952887,0.0004544053,0.04384655,0.002111931,0.0000158569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05727269,0.0007822908,0.9252349,0.001346392,0.000310533,0.0004139644,0.0005439483,0.0006501225,0.01344518],"genre_scores_gemma":[0.3104786,0.0004521006,0.6801086,0.0003496822,0.0002181114,0.0004568302,0.0007538233,0.0002481769,0.00693407],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006892686,"threshold_uncertainty_score":0.0230583,"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."}}