{"id":"W2098907131","doi":"10.1007/s00453-007-9013-x","title":"Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Vertex (graph theory); Approximation algorithm; Integer (computer science); Graph; Theory of computation; Tree (set theory); Binary logarithm; Discrete mathematics; Algorithm; 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":[],"consensus_categories":[],"category_scores_codex":[0.0006555042,0.0002431757,0.0002625369,0.0001872831,0.0004043887,0.0001624414,0.0007851493,0.00009892573,0.00004093852],"category_scores_gemma":[0.00005266998,0.0002227039,0.00009476898,0.000482652,0.0001228436,0.0003822851,0.0007524787,0.0002147933,0.00005923296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006333253,"about_ca_system_score_gemma":0.00003516095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001903817,"about_ca_topic_score_gemma":0.0004222261,"domain_scores_codex":[0.9980085,0.00003695389,0.0004071911,0.0006030382,0.000375273,0.0005690106],"domain_scores_gemma":[0.9987536,0.0002343971,0.000122876,0.0006058076,0.00006859466,0.0002147467],"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.00001455793,0.0001755654,0.001093081,0.00003923858,0.00007919575,0.0001759963,0.001970934,0.00001111979,0.004358932,0.08990022,0.001632337,0.9005488],"study_design_scores_gemma":[0.003595311,0.0007011171,0.0278318,0.0002279964,0.00007922239,0.001245301,0.0004015835,0.5395602,0.04940075,0.06720223,0.3067721,0.00298238],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0599218,0.00136989,0.9080853,0.004141912,0.0008090304,0.0003578811,0.000008462656,0.0007067712,0.02459893],"genre_scores_gemma":[0.3871096,0.00003263359,0.6086971,0.0009443752,0.0005582512,0.00002090835,0.000008167101,0.00003945447,0.002589552],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8975664,"threshold_uncertainty_score":0.9081603,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01189146841732054,"score_gpt":0.2329888447457489,"score_spread":0.2210973763284284,"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."}}