{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001160411,0.0007371742,0.001312756,0.001501986,0.001110541,0.001610063,0.002130556,0.001400742,0.004885531],"category_scores_gemma":[0.01311143,0.0006715895,0.0007630185,0.002169394,0.00132411,0.004765002,0.00241797,0.001541991,0.0005161852],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001044506,"about_ca_system_score_gemma":0.0006378223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001152233,"about_ca_topic_score_gemma":0.002028908,"domain_scores_codex":[0.9993699,0.0002331322,0.0000344247,0.0001137748,0.0001814181,0.00006727635],"domain_scores_gemma":[0.9958665,0.002944653,0.0002744294,0.0002793621,0.0004406759,0.0001942734],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002292361,0.00008387415,0.0008624844,0.0002722685,0.00003976929,0.0001273997,0.000323263,0.1586316,0.002107784,0.7551854,0.007540195,0.07459666],"study_design_scores_gemma":[0.00002374925,0.00004292322,0.0003118607,0.00005074598,0.00002195842,0.0001251096,0.000108377,0.3477725,0.0004993333,0.6472992,0.003731295,0.00001291089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09481899,0.002956775,0.8767856,0.001647645,0.0002192251,0.00009571218,0.0003175888,0.0001909846,0.02296728],"genre_scores_gemma":[0.6371682,0.003966077,0.3433277,0.0004123252,0.0004678632,0.0002191656,0.0007413537,0.0002940462,0.01340325],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004885531,"threshold_uncertainty_score":0.01634371,"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."}}