{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000605082,0.0001451353,0.0002774054,0.0002388589,0.0002724209,0.0002283761,0.0003072283,0.00008995254,0.000004718462],"category_scores_gemma":[0.0002099506,0.0001266344,0.00009393803,0.0002724387,0.00005873502,0.0007073613,0.0001297198,0.0001158707,2.128354e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002943093,"about_ca_system_score_gemma":0.00003509464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002643885,"about_ca_topic_score_gemma":0.000002114441,"domain_scores_codex":[0.9988772,0.0000765411,0.0004462119,0.0002000967,0.0002291262,0.0001708002],"domain_scores_gemma":[0.9986448,0.0002289911,0.0004167121,0.0001953996,0.000381715,0.0001323766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002223757,0.0003864589,0.0004350824,0.0001150795,0.0001495838,0.000002939099,0.001180846,0.01734478,0.002681506,0.9534487,0.001070102,0.02296262],"study_design_scores_gemma":[0.003081369,0.0006928836,0.0002597238,0.00003624315,0.0000390285,0.00005424761,0.00001337682,0.9161119,0.0006760479,0.07304461,0.00579131,0.0001992544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006904257,0.0002062044,0.9887932,0.001562491,0.001991135,0.0002263061,0.00000282871,0.00003321392,0.0002803847],"genre_scores_gemma":[0.3665302,0.0001703396,0.6323206,0.0001458235,0.000673886,0.00001690702,0.000006419893,0.00002229603,0.0001134565],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8987671,"threshold_uncertainty_score":0.5164003,"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."}}