{"id":"W2183636263","doi":"","title":"Approximating Full Steiner Tree in a Unit Disk Graph.","year":2014,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Steiner tree problem; Combinatorics; Gomory–Hu tree; k-minimum spanning tree; K-ary tree; Mathematics; Graph; Tree (set theory); Approximation algorithm; Discrete mathematics; Tree structure; Binary tree","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.0007001044,0.0008270555,0.001087618,0.001217374,0.0005762868,0.001353574,0.001481005,0.001017756,0.004337194],"category_scores_gemma":[0.005663836,0.0004410332,0.0005837729,0.002227438,0.0004728319,0.003183538,0.001454467,0.0007749902,0.001103223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001468905,"about_ca_system_score_gemma":0.001026306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00390494,"about_ca_topic_score_gemma":0.005278199,"domain_scores_codex":[0.9992985,0.0001900936,0.00004599453,0.0001384264,0.0002006992,0.00012634],"domain_scores_gemma":[0.9981785,0.0009363475,0.0002038471,0.0003409629,0.000216342,0.0001240077],"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.001244155,0.000308612,0.004127226,0.0006023216,0.0001355831,0.0005106317,0.0005744516,0.6761711,0.00997898,0.04212868,0.02258653,0.2416318],"study_design_scores_gemma":[0.00004363068,0.00008208489,0.0004626468,0.00002529352,0.00001871987,0.0002835825,0.0001421539,0.9589562,0.00152991,0.0350337,0.003412331,0.000009730737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3122288,0.002596653,0.6685307,0.0009312727,0.0001551671,0.000172129,0.001546805,0.001903659,0.01193491],"genre_scores_gemma":[0.50398,0.0008288486,0.4869804,0.0001595729,0.00005042357,0.0001340363,0.002587899,0.0002978957,0.004980906],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004337194,"threshold_uncertainty_score":0.01450938,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0220430912026081,"score_gpt":0.237128835320026,"score_spread":0.2150857441174179,"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."}}