{"id":"W2036493899","doi":"10.1007/s00224-014-9591-3","title":"On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods","year":2014,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo; University of Manitoba; Dalhousie University","funders":"","keywords":"Minimum spanning tree; Spanning tree; Mathematics; Parameterized complexity; Disjoint sets; Euclidean minimum spanning tree; Minimum weight; Combinatorics; Connected dominating set; Euclidean geometry; Steiner tree problem; Approximation algorithm; Set (abstract data type); Point (geometry); Mathematical proof; Kruskal's algorithm; Mathematical optimization; 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.001295457,0.0001907694,0.0003127783,0.0002108729,0.0001706407,0.0001269678,0.0003740219,0.000055188,0.000002253349],"category_scores_gemma":[0.00006948118,0.0001539068,0.00004059586,0.000330976,0.0000776884,0.0001549674,0.0001036641,0.00009951801,0.000008240789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001757398,"about_ca_system_score_gemma":0.00003686078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006357379,"about_ca_topic_score_gemma":6.939941e-7,"domain_scores_codex":[0.998306,0.0003801248,0.0003492786,0.0003890167,0.0003448438,0.0002307761],"domain_scores_gemma":[0.9980161,0.001129618,0.0002677573,0.0003781884,0.0001188128,0.00008953879],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005968291,0.00006283294,0.0003853079,0.0000894254,0.00004834692,0.000003685261,0.001635687,0.05023658,0.0008455735,0.9002172,0.0001761692,0.04623956],"study_design_scores_gemma":[0.001104659,0.001001067,0.006105708,0.0005070854,0.0000216457,0.0000916009,0.0001361519,0.9507629,0.00139531,0.03780262,0.0006827927,0.0003884927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3627776,0.0001913174,0.6330203,0.00006906904,0.0003680324,0.0001176321,6.722325e-7,0.00008336267,0.003372018],"genre_scores_gemma":[0.9899843,0.000001554296,0.009478426,0.000104279,0.0002416071,0.000002815976,0.000003169489,0.00001276113,0.0001710407],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9005263,"threshold_uncertainty_score":0.6276135,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01034062075288837,"score_gpt":0.2233376238070862,"score_spread":0.2129970030541978,"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."}}