{"id":"W2086252334","doi":"10.1007/s00453-003-1056-z","title":"Computing a (1+ε)-Approximate Geometric Minimum-Diameter Spanning Tree","year":2003,"lang":"en","type":"article","venue":"Algorithmica","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Spanning tree; Minimum spanning tree; Tree (set theory); Theory of computation; Path (computing); k-minimum spanning tree; Range tree; Grid; Euclidean minimum spanning tree; Running time; Upper and lower bounds; Plane (geometry); Binary logarithm; Connected dominating set; K-ary tree; Algorithm; Tree structure; Binary tree; Geometry; Computer science","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.001011282,0.0009615064,0.001490962,0.00114553,0.0008873689,0.001520565,0.002260127,0.002147192,0.005309641],"category_scores_gemma":[0.0111942,0.0006098205,0.0007912355,0.001783084,0.0007417441,0.003634186,0.001758713,0.001066993,0.001129791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001134946,"about_ca_system_score_gemma":0.001124055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0014513,"about_ca_topic_score_gemma":0.002641878,"domain_scores_codex":[0.9990878,0.0001904358,0.00006788268,0.0002688096,0.0002707588,0.0001143672],"domain_scores_gemma":[0.9975786,0.001363339,0.0002023684,0.0003965963,0.0003124932,0.0001465709],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001089508,0.0003246344,0.004173462,0.0006170003,0.0001358381,0.0002534097,0.0003361958,0.649925,0.01726531,0.03958413,0.01290547,0.27339],"study_design_scores_gemma":[0.00005431527,0.00009863715,0.0005068298,0.00001831852,0.00003306644,0.0001518028,0.0001147016,0.9701176,0.003592579,0.02391146,0.001391913,0.000008703289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2362163,0.0007751662,0.749727,0.001516486,0.0002180634,0.0001551416,0.0008182473,0.001649772,0.0089239],"genre_scores_gemma":[0.4873836,0.0003086727,0.5077671,0.0001322647,0.00007325917,0.0001329139,0.001171441,0.0002484305,0.002782331],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005309641,"threshold_uncertainty_score":0.01776254,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01759218772458964,"score_gpt":0.2454513736463601,"score_spread":0.2278591859217705,"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."}}