{"id":"W2086070368","doi":"10.1016/j.comgeo.2015.02.004","title":"On full Steiner trees in unit disk graphs","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner tree problem; Combinatorics; Mathematics; Gomory–Hu tree; k-minimum spanning tree; K-ary tree; Tree (set theory); Unit disk; Graph; Approximation algorithm; Discrete mathematics; Tree structure; Binary tree","routes":{"ca_aff":true,"ca_fund":true,"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.001284444,0.001481292,0.002546273,0.003014255,0.002097409,0.005067657,0.004013622,0.00212719,0.01369205],"category_scores_gemma":[0.01448407,0.001265796,0.001361157,0.006700781,0.00312279,0.0145193,0.004033445,0.003471441,0.00126753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003226296,"about_ca_system_score_gemma":0.001315714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003427385,"about_ca_topic_score_gemma":0.004138841,"domain_scores_codex":[0.9981415,0.0006167051,0.00008149902,0.0002900916,0.0005276558,0.0003424506],"domain_scores_gemma":[0.986472,0.01026797,0.001059479,0.001007766,0.0005642033,0.0006286248],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003702182,0.0001591079,0.001492591,0.0005647528,0.00007248425,0.0001975218,0.0006437223,0.1315601,0.001552684,0.8047739,0.01851161,0.04010127],"study_design_scores_gemma":[0.00003524417,0.00002408193,0.0005391081,0.00004926587,0.00002481268,0.00009920633,0.0001698546,0.1091503,0.0003677378,0.8869237,0.002599439,0.00001718688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5062788,0.008703259,0.3823641,0.009594758,0.0004165939,0.0002262914,0.002952022,0.0007340742,0.08873016],"genre_scores_gemma":[0.8782927,0.008438298,0.08388801,0.001083376,0.001066168,0.0003001878,0.003237591,0.000565097,0.02312857],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01369205,"threshold_uncertainty_score":0.0458045,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04795850184395449,"score_gpt":0.2820005581469356,"score_spread":0.2340420563029811,"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."}}