{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005739404,0.000920496,0.001181938,0.001209017,0.0007232739,0.00140985,0.002007248,0.001131016,0.0117338],"category_scores_gemma":[0.002479112,0.0005945125,0.0006459758,0.001902829,0.0004842389,0.002736861,0.001604212,0.001090432,0.001834614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001266467,"about_ca_system_score_gemma":0.002178351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003117608,"about_ca_topic_score_gemma":0.005824644,"domain_scores_codex":[0.999447,0.000110557,0.00003651871,0.000134833,0.0001702812,0.0001007804],"domain_scores_gemma":[0.9994054,0.0002745322,0.00005191228,0.0001105737,0.0001104806,0.0000471],"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.000570179,0.000347079,0.0006580011,0.0004616565,0.00008984924,0.0001595759,0.000159526,0.2763928,0.009311185,0.05321693,0.02415147,0.6344817],"study_design_scores_gemma":[0.0002315247,0.0001738539,0.0003979513,0.00003764927,0.00004062867,0.0001939621,0.0001089226,0.94257,0.002947675,0.04427854,0.008994565,0.0000246876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03344138,0.0007103642,0.9457813,0.0005101943,0.0001451484,0.000174891,0.0003824203,0.002030551,0.01682373],"genre_scores_gemma":[0.1493171,0.0004006117,0.8431135,0.0001579508,0.00005862295,0.0001942886,0.000930544,0.0002540507,0.005573357],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0117338,"threshold_uncertainty_score":0.03925347,"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."}}