{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001994019,0.001535224,0.002243921,0.001454863,0.001649539,0.003035317,0.005070372,0.002760439,0.01745135],"category_scores_gemma":[0.006316232,0.0007650272,0.002041907,0.003362641,0.0008903485,0.004544004,0.003120228,0.003086336,0.003196048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003479318,"about_ca_system_score_gemma":0.005496836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004473695,"about_ca_topic_score_gemma":0.008048987,"domain_scores_codex":[0.9979289,0.0005233692,0.0001488823,0.0003729787,0.000469022,0.0005567725],"domain_scores_gemma":[0.9972042,0.001221294,0.0002315647,0.0006130203,0.0003389912,0.0003907616],"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.002984661,0.001612394,0.00291048,0.001045969,0.0002803758,0.0003071336,0.000520489,0.3339286,0.006775417,0.08716663,0.06531628,0.4971515],"study_design_scores_gemma":[0.0004842681,0.0003134187,0.001103725,0.00008044823,0.0001270964,0.0003762531,0.0002681032,0.8841546,0.002569603,0.09960035,0.01087049,0.00005164107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1496562,0.001920666,0.7920925,0.005147332,0.0007411355,0.0008541351,0.002874658,0.004628459,0.04208492],"genre_scores_gemma":[0.2796259,0.0005354402,0.704816,0.0005983192,0.0001982376,0.0005452657,0.003145938,0.0004652135,0.01006975],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01745135,"threshold_uncertainty_score":0.05838054,"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."}}