{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002361901,0.001979289,0.00302887,0.002154017,0.00161034,0.004338806,0.004548337,0.003309538,0.01464683],"category_scores_gemma":[0.02115354,0.001482477,0.001766132,0.004476363,0.002131569,0.01063174,0.003969671,0.003952463,0.002172263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003486985,"about_ca_system_score_gemma":0.002237943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004183467,"about_ca_topic_score_gemma":0.00963479,"domain_scores_codex":[0.9983525,0.0004375187,0.00007719688,0.0003222545,0.0003990744,0.0004113774],"domain_scores_gemma":[0.9886665,0.007075117,0.000817497,0.001778196,0.0007256276,0.0009370727],"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.003646592,0.001075512,0.01266482,0.001342467,0.000283783,0.0005876431,0.0009980313,0.4845429,0.007178374,0.2653974,0.05399026,0.1682923],"study_design_scores_gemma":[0.0001737458,0.0001274215,0.0009244293,0.0000663368,0.0001142785,0.0002219635,0.0003019248,0.6763538,0.001298639,0.3173909,0.003000576,0.00002607939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5847876,0.004421087,0.3616216,0.006188586,0.0003764546,0.0002912712,0.002844348,0.002176259,0.03729277],"genre_scores_gemma":[0.8057961,0.00153587,0.1745641,0.0007803137,0.0003105487,0.0001729735,0.00346673,0.0008360646,0.01253722],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01464683,"threshold_uncertainty_score":0.04899853,"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."}}