{"id":"W2177638926","doi":"10.5555/2095116.2095235","title":"Approximating rooted Steiner networks","year":2012,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Steiner tree problem; Combinatorics; Generalization; Linear programming relaxation; Undirected graph; Mathematics; Approximation algorithm; Discrete mathematics; Linear programming; Focus (optics); Relaxation (psychology); Computer science; Mathematical optimization; Graph","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.001357257,0.0008987084,0.001079742,0.0009871023,0.0006413446,0.002038158,0.002321159,0.001338067,0.006019447],"category_scores_gemma":[0.01468005,0.000721538,0.0008573646,0.001941294,0.001074107,0.005135025,0.002441752,0.002291915,0.000759244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002035999,"about_ca_system_score_gemma":0.0007950001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001929805,"about_ca_topic_score_gemma":0.003021328,"domain_scores_codex":[0.9983358,0.0005401224,0.00008002566,0.0003790566,0.0004416384,0.0002234627],"domain_scores_gemma":[0.9922047,0.005579858,0.0005649867,0.0008959681,0.0004440057,0.0003104197],"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.0003865676,0.0001206926,0.001989622,0.0004078058,0.00007592399,0.00015167,0.0003324525,0.7355159,0.003678229,0.1787516,0.008933757,0.06965581],"study_design_scores_gemma":[0.00003082017,0.00003985323,0.0003886892,0.00003676862,0.00002098966,0.0001069568,0.0000937109,0.8345957,0.001054323,0.1600073,0.003615214,0.000009683245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1462526,0.001752251,0.8196985,0.001898435,0.0001161646,0.0001234691,0.001081718,0.0009602782,0.02811668],"genre_scores_gemma":[0.7372486,0.001588125,0.2510248,0.0003823181,0.0001486575,0.0001825505,0.001894274,0.0003544145,0.007176259],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006019447,"threshold_uncertainty_score":0.02013707,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01763125246592238,"score_gpt":0.252691496209125,"score_spread":0.2350602437432026,"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."}}