{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000658794,0.0001839317,0.0001969766,0.0005044258,0.0002725929,0.0002246886,0.0004548552,0.00006624521,0.00002909068],"category_scores_gemma":[0.0002352941,0.0001850713,0.00009595506,0.002010659,0.00002799283,0.0003891028,0.0001275839,0.0001854945,0.0001177646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004911304,"about_ca_system_score_gemma":0.00008625108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005351717,"about_ca_topic_score_gemma":5.875072e-7,"domain_scores_codex":[0.9982581,0.0001590921,0.000315096,0.0005073418,0.0003572788,0.0004031386],"domain_scores_gemma":[0.998895,0.0003378792,0.0001204901,0.0003886406,0.0001280038,0.0001299187],"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.000003550252,0.0002217271,0.0004717703,0.00002757678,0.00007512989,0.00005137129,0.0007819888,0.005495035,0.001969464,0.05516579,0.003274231,0.9324624],"study_design_scores_gemma":[0.001065664,0.0001746132,0.003004902,0.00003033007,0.00002018773,0.0001953067,0.00006022306,0.9386023,0.02402779,0.009643205,0.02249688,0.0006786247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01968402,0.0002848392,0.973581,0.0002050711,0.0006724318,0.0001489356,0.000001360377,0.0001930399,0.005229261],"genre_scores_gemma":[0.5054232,0.000003785355,0.4937205,0.0003376991,0.0001325982,0.00000674043,0.000006938863,0.00001108467,0.0003574798],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9331073,"threshold_uncertainty_score":0.754699,"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."}}