{"id":"W1982713256","doi":"10.1016/j.disopt.2010.08.001","title":"The minimum spanning tree problem with conflict constraints and its variations","year":2010,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Time complexity; k-minimum spanning tree; Clique; Steiner tree problem; Bounded function; Spanning tree; Graph; Minimum spanning tree; Heuristic; Discrete mathematics; Mathematical optimization; 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.0002046362,0.0001010384,0.00007731058,0.00004758408,0.0005363298,0.000382949,0.0003111552,0.00004227783,0.00001468648],"category_scores_gemma":[0.00004249289,0.00006896999,0.00001936673,0.0002715356,0.0001627801,0.0004047397,0.00009345962,0.0001490525,0.000002393177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004621429,"about_ca_system_score_gemma":0.00004623387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005133616,"about_ca_topic_score_gemma":0.00002627683,"domain_scores_codex":[0.9992623,0.00003375835,0.0001389482,0.0002335985,0.0001564085,0.0001749926],"domain_scores_gemma":[0.9993632,0.0001234921,0.00008947663,0.0002463799,0.0001125983,0.00006483585],"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.00001010129,0.00002517217,0.0003425946,0.000009005592,0.00003693014,0.000003704293,0.001607748,0.01803707,0.0004528281,0.9492612,0.00008114103,0.03013249],"study_design_scores_gemma":[0.0002955045,0.00004828156,0.0008016586,0.00001384304,0.000008495686,0.00002481898,0.00004821374,0.9959275,0.0001317824,0.001753001,0.0008190952,0.0001278344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001592169,0.0000426987,0.9897717,0.001648249,0.0001610871,0.0002411111,0.000005158003,0.00009464808,0.006443175],"genre_scores_gemma":[0.5328751,0.00004044624,0.4666281,0.0001009801,0.00005606125,0.00003381513,0.00001610333,0.00001065485,0.0002387359],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9778904,"threshold_uncertainty_score":0.4125069,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01236291145485941,"score_gpt":0.2336600920583558,"score_spread":0.2212971806034964,"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."}}