{"id":"W2949081670","doi":"10.48550/arxiv.1305.0172","title":"An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Steiner tree problem; Combinatorics; k-minimum spanning tree; Mathematics; K-ary tree; Disjoint sets; Logarithm; Matching (statistics); Tree (set theory); Spanning tree; Euclidean minimum spanning tree; Discrete mathematics; Gomory–Hu tree; Upper and lower bounds; Minimum degree spanning tree; 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.0005958552,0.001027946,0.0009644387,0.001083197,0.0007512934,0.001476996,0.002116036,0.001392359,0.01036865],"category_scores_gemma":[0.002443678,0.0005037299,0.0006795362,0.001859807,0.0004845848,0.003318396,0.001715893,0.0009216118,0.002443875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0013521,"about_ca_system_score_gemma":0.001817296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002279354,"about_ca_topic_score_gemma":0.003866639,"domain_scores_codex":[0.9991769,0.0001348591,0.00006882983,0.0002418862,0.0002146217,0.0001628867],"domain_scores_gemma":[0.9994944,0.0001931469,0.00005198018,0.0001388881,0.00008412661,0.00003742585],"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.0008534103,0.0004827693,0.001102324,0.0006513747,0.0001183368,0.000276787,0.0003110128,0.159789,0.01697322,0.08829893,0.0425792,0.6885636],"study_design_scores_gemma":[0.0004485434,0.0002680948,0.0006373345,0.00006749998,0.00007202378,0.0004510545,0.0002396981,0.8527235,0.006935482,0.1171905,0.02091626,0.00005008105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04879528,0.0008227903,0.9222662,0.0008634609,0.000144276,0.0003471579,0.0008603248,0.004711265,0.02118923],"genre_scores_gemma":[0.1761104,0.0004097696,0.8161194,0.0002029341,0.00005239937,0.000307813,0.001892019,0.0002993082,0.004606042],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01036865,"threshold_uncertainty_score":0.03468657,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04220076924491658,"score_gpt":0.1779886769648603,"score_spread":0.1357879077199437,"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."}}