{"id":"W2599445248","doi":"10.1007/s11590-017-1135-8","title":"A 5-approximation algorithm for the k-prize-collecting Steiner tree problem","year":2017,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Steiner tree problem; Combinatorics; k-minimum spanning tree; Vertex (graph theory); Mathematics; Spanning tree; Gomory–Hu tree; Tree (set theory); Minimum spanning tree; Graph; Minimum degree spanning tree; Integer (computer science); Discrete mathematics; K-ary tree; Computer science; Tree structure; Binary tree","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":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004040211,0.0001282187,0.0001140691,0.00007847576,0.001866155,0.00105393,0.001183605,0.00003926728,0.00001091514],"category_scores_gemma":[0.00008778035,0.00009874089,0.00009230833,0.0001795496,0.00008690159,0.0008417541,0.0001976322,0.00009672679,0.000003848621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003402993,"about_ca_system_score_gemma":0.00002672594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002449041,"about_ca_topic_score_gemma":0.000006111174,"domain_scores_codex":[0.9989992,0.0000365105,0.0002040278,0.0003115073,0.0002125842,0.0002361911],"domain_scores_gemma":[0.9986514,0.000180171,0.0002596448,0.0007681518,0.0001031936,0.00003742468],"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.000005932884,0.00005005961,0.00005719185,0.00001980613,0.00006013246,0.000002101015,0.0008116362,0.2206896,0.0002599428,0.01226593,0.00628665,0.759491],"study_design_scores_gemma":[0.0005098505,0.00002326643,0.0001380133,0.00001527688,0.00001074998,0.000004930417,0.00001528619,0.9954375,0.0002240886,0.0009309984,0.002548387,0.0001416614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004056281,0.00001909896,0.9782392,0.01965279,0.0004623346,0.000591476,0.000003890566,0.0001189249,0.0008717738],"genre_scores_gemma":[0.001990433,0.000009340039,0.9959106,0.001318486,0.0001995981,0.0001707578,0.00000815148,0.00001327454,0.000379394],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7747479,"threshold_uncertainty_score":0.9999831,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02933868493811216,"score_gpt":0.2610525395029371,"score_spread":0.2317138545648249,"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."}}