{"id":"W2014708079","doi":"10.1007/s10878-014-9774-5","title":"Improved approximations for buy-at-bulk and shallow-light $$k$$ k -Steiner trees and $$(k,2)$$ ( k , 2 ) -subgraph","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Steiner tree problem; Mathematics; Bounded function; Graph; Integer (computer science); Tree (set theory); Approximation algorithm; Function (biology); Discrete mathematics; Mathematical analysis; 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.004291131,0.003932688,0.004636405,0.002430608,0.001991252,0.005278484,0.008272212,0.004523527,0.03253344],"category_scores_gemma":[0.02910307,0.002123458,0.003615873,0.004699487,0.002512974,0.01264831,0.004955624,0.006277605,0.005997569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007790305,"about_ca_system_score_gemma":0.006885245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01280143,"about_ca_topic_score_gemma":0.03336058,"domain_scores_codex":[0.9966555,0.0009148462,0.0001327589,0.0005953099,0.0008443396,0.0008573162],"domain_scores_gemma":[0.9848627,0.009631582,0.0006117956,0.002889698,0.001018215,0.000985957],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002037328,0.0008398965,0.002649493,0.0009891181,0.0002375093,0.000275998,0.0004862663,0.6783684,0.002478867,0.1128047,0.0728059,0.1260265],"study_design_scores_gemma":[0.0001071243,0.00006672575,0.0002550449,0.00006891118,0.00007461969,0.0000870252,0.0001292652,0.9187593,0.0005205619,0.07741348,0.002496597,0.00002131327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1237368,0.005409786,0.8009067,0.006677188,0.001107278,0.0006910619,0.004628246,0.00701619,0.04982679],"genre_scores_gemma":[0.4233326,0.001828944,0.5406392,0.001775031,0.0006446387,0.0005941021,0.006298687,0.003091912,0.02179489],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03253344,"threshold_uncertainty_score":0.1088352,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008175121224844557,"score_gpt":0.2191575883703198,"score_spread":0.2109824671454752,"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."}}