{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001041637,0.001223599,0.001865665,0.001423057,0.001251155,0.001678381,0.001759995,0.001393514,0.007212024],"category_scores_gemma":[0.007024862,0.0006574697,0.001006254,0.003065265,0.001511597,0.004126341,0.003149841,0.002339339,0.0006087776],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001510363,"about_ca_system_score_gemma":0.0006840041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002195643,"about_ca_topic_score_gemma":0.003208605,"domain_scores_codex":[0.9993439,0.0002616547,0.00002716121,0.0001386381,0.0001316954,0.00009699736],"domain_scores_gemma":[0.9976865,0.0013891,0.0002306756,0.0002784324,0.0002214148,0.0001937597],"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.0002907369,0.00007914802,0.000646773,0.0004378769,0.0001155109,0.0002183328,0.0005590181,0.1556391,0.003581908,0.7403218,0.01570978,0.08239999],"study_design_scores_gemma":[0.00003381975,0.00004002357,0.0003526536,0.00005602639,0.00003315294,0.0001236299,0.0001109203,0.1242481,0.0003594534,0.8693575,0.005271743,0.00001300302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.226625,0.005155038,0.7091008,0.003906641,0.00070093,0.0002005304,0.0007400564,0.0004434036,0.05312762],"genre_scores_gemma":[0.7443805,0.005887922,0.2229984,0.001210142,0.0007313471,0.0002297537,0.001478766,0.0004381603,0.02264499],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007212024,"threshold_uncertainty_score":0.02412659,"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."}}