{"id":"W2068598660","doi":"10.1016/j.comgeo.2013.10.001","title":"An optimal algorithm for the Euclidean bottleneck full Steiner tree problem","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Steiner tree problem; Combinatorics; k-minimum spanning tree; Mathematics; Disjoint sets; Logarithm; K-ary tree; Gomory–Hu tree; Matching (statistics); Tree (set theory); Discrete mathematics; Euclidean minimum spanning tree; Upper and lower bounds; Spanning tree; Tree structure; Minimum degree spanning tree; 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.0001485359,0.0001443439,0.0001244528,0.000123543,0.00009896351,0.000104916,0.0002391164,0.0000691288,0.000158287],"category_scores_gemma":[0.000008664744,0.0001114615,0.00006929616,0.0002230348,0.00003400155,0.0002279685,0.0000206542,0.0001108543,0.00007713789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003144278,"about_ca_system_score_gemma":0.00001499907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006332267,"about_ca_topic_score_gemma":6.740404e-7,"domain_scores_codex":[0.9992263,0.00001360499,0.0002040908,0.0001604464,0.0001727007,0.0002228147],"domain_scores_gemma":[0.9993656,0.0002383132,0.00002853808,0.0001630244,0.0001318359,0.00007272774],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002906207,0.00003899218,0.00004570784,0.00002874474,0.00006269783,8.823445e-7,0.00006987864,0.2799678,0.0007301494,0.0005640766,0.01959819,0.69889],"study_design_scores_gemma":[0.0002210959,0.0001301812,0.002288932,0.000008739801,0.0000131751,0.000009645112,0.00004195236,0.9886578,0.0005463971,0.00467821,0.003226093,0.0001777938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01186313,0.0003896557,0.985803,0.0001115415,0.0001242412,0.00053915,0.0000323472,0.0004930445,0.0006438926],"genre_scores_gemma":[0.4609056,0.00001079381,0.5380896,0.0001251831,0.0002936437,0.0002685412,0.0001039536,0.00004695188,0.0001557383],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.70869,"threshold_uncertainty_score":0.454527,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01036784220015194,"score_gpt":0.2310436880264128,"score_spread":0.2206758458262608,"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."}}