{"id":"W2151339549","doi":"10.1016/s0377-2217(00)00267-8","title":"On generalized minimum spanning trees","year":2001,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Transport Systems and Technology","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Minimum spanning tree; Spanning tree; Distributed minimum spanning tree; Minimum degree spanning tree; Kruskal's algorithm; Euclidean minimum spanning tree; Mathematics; Tree (set theory); Mathematical optimization; Combinatorics; k-minimum spanning tree; Computer science; Connected dominating set; Steiner tree problem; Tree structure; K-ary 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001550895,0.00007587217,0.0001274302,0.0003366599,0.0001014635,0.00005501727,0.0002434151,0.00002290888,0.0003114372],"category_scores_gemma":[0.00008646398,0.00006122715,0.00005488795,0.0002099926,0.00004557929,0.0001063832,0.0000127048,0.0004549536,0.0001667645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004381064,"about_ca_system_score_gemma":0.00003499343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002055107,"about_ca_topic_score_gemma":0.000004001196,"domain_scores_codex":[0.9986719,0.0001944235,0.0003425194,0.00007758077,0.0005035008,0.0002100439],"domain_scores_gemma":[0.999451,0.00008421197,0.00002603158,0.0001126663,0.0002393136,0.00008672437],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006885417,0.0003715237,0.007426375,0.00007702118,0.0005273684,0.01285771,0.001753101,0.3708704,0.2720723,0.105233,0.1654208,0.0627019],"study_design_scores_gemma":[0.00518431,0.002270639,0.1004963,0.0005474326,0.0000186749,0.002041174,0.0003893153,0.01883908,0.00766471,0.001193693,0.860747,0.000607618],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9573635,0.0004890699,0.00338887,0.0006547829,0.0002425384,0.00005909167,0.000002435932,0.00003852835,0.03776112],"genre_scores_gemma":[0.9973735,0.00014931,0.001011637,0.00002855115,0.000395333,0.000001022735,0.000002578783,0.00002915015,0.001008886],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6953263,"threshold_uncertainty_score":0.3410019,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07062903256916202,"score_gpt":0.3185065023513536,"score_spread":0.2478774697821916,"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."}}