{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004476294,0.0001126384,0.0001469728,0.0001988506,0.00007947844,0.0001184825,0.0007725502,0.00003593294,0.00002769889],"category_scores_gemma":[0.00004609282,0.00009426315,0.00005948317,0.0007907024,0.00004618401,0.0002971734,0.0002772632,0.0001404459,0.00003330599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007589733,"about_ca_system_score_gemma":0.00001164682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009740234,"about_ca_topic_score_gemma":0.0004303242,"domain_scores_codex":[0.9989281,0.00008168299,0.0002303024,0.0002984577,0.0001917174,0.0002697678],"domain_scores_gemma":[0.9992326,0.0001370844,0.00004783994,0.0004910411,0.00002648211,0.00006489611],"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.000002100152,0.00007465632,0.001862265,0.00001260898,0.000004685345,0.000003465901,0.0004041636,0.0000926924,0.000185892,0.7348077,0.0001462407,0.2624036],"study_design_scores_gemma":[0.0005183127,0.0001077522,0.006700904,0.00002990486,0.000001848745,0.00001025761,0.00006848178,0.7961065,0.0002784427,0.192479,0.00343743,0.0002611098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03534421,0.00002069875,0.9233076,0.0005534685,0.0001517502,0.00008806799,4.395736e-7,0.000193009,0.04034073],"genre_scores_gemma":[0.6859592,0.000002435036,0.3131488,0.0003646925,0.00005714409,0.00001453045,0.000001458114,0.000006724335,0.0004449702],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7960138,"threshold_uncertainty_score":0.384394,"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."}}