{"id":"W1636181092","doi":"10.1007/978-3-642-25591-5_4","title":"Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Approximation algorithm; Graph; Function (biology); Bounded function; Linear programming relaxation; Tree (set theory); k-minimum spanning tree; Integer (computer science); Discrete mathematics; Algorithm; K-ary tree; Computer science; Binary tree; Tree structure; Mathematical analysis; Linear programming","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.004278012,0.004153849,0.005075942,0.003001197,0.002214584,0.006011092,0.009541322,0.004569585,0.04069355],"category_scores_gemma":[0.02816373,0.002054962,0.004366248,0.007143485,0.002504278,0.01564712,0.00563269,0.007639292,0.008948022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008183124,"about_ca_system_score_gemma":0.006620229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0111957,"about_ca_topic_score_gemma":0.03189494,"domain_scores_codex":[0.9960018,0.0009701131,0.0001906106,0.0007236215,0.001194032,0.0009198885],"domain_scores_gemma":[0.984603,0.008368745,0.0006122661,0.004445281,0.001092541,0.0008781835],"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.002656667,0.001186049,0.002573118,0.001439729,0.0003158402,0.000320254,0.0007524637,0.3959551,0.004221923,0.1934459,0.1135652,0.2835677],"study_design_scores_gemma":[0.0002377027,0.0001142255,0.0004359098,0.0001421127,0.0001658978,0.0001954983,0.0002508403,0.7790907,0.001300925,0.2104708,0.007549919,0.00004536998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0823878,0.005698785,0.8418956,0.00487936,0.001208953,0.000695507,0.004679785,0.009076213,0.04947808],"genre_scores_gemma":[0.252014,0.002052975,0.7084011,0.001364049,0.0007457461,0.0006424287,0.007000537,0.003515036,0.02426417],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04069355,"threshold_uncertainty_score":0.1361335,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02149638194481156,"score_gpt":0.2290866575978369,"score_spread":0.2075902756530253,"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."}}