{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006267474,0.0005886054,0.0005817859,0.0008713921,0.0006300845,0.000532941,0.001855273,0.00031803,0.00001581616],"category_scores_gemma":[0.00006428626,0.000521256,0.0001520085,0.0004475739,0.00106684,0.0006150631,0.001836762,0.000454896,0.000003535877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008592079,"about_ca_system_score_gemma":0.0001535076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003197091,"about_ca_topic_score_gemma":0.0004770187,"domain_scores_codex":[0.9966294,0.00002386265,0.0005050726,0.001732732,0.0004514551,0.0006574676],"domain_scores_gemma":[0.9976871,0.0004731493,0.0002660651,0.001110859,0.0002177058,0.0002451483],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001917895,0.00005947016,0.00008135787,0.0001542421,0.00004120142,0.00001902599,0.002007612,0.0001674955,0.0007375258,0.2335623,0.00004288567,0.7631077],"study_design_scores_gemma":[0.0006041618,0.0003471565,0.0002866295,0.0002125344,0.00002184551,0.000119407,3.128554e-7,0.4584974,0.001053499,0.5318536,0.006126278,0.0008772356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002477391,0.001277278,0.9937165,0.0009501271,0.0008804784,0.0007649902,0.0000268752,0.0001588349,0.001977121],"genre_scores_gemma":[0.05132134,0.0002371636,0.9451647,0.001162473,0.00044475,0.00008833891,0.0000135903,0.00006137458,0.001506275],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7622305,"threshold_uncertainty_score":0.9997239,"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."}}