{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002123986,0.001001541,0.00189986,0.001165006,0.0008828785,0.002910821,0.002651307,0.002293224,0.003491195],"category_scores_gemma":[0.01013703,0.0007115816,0.001024027,0.004716706,0.001709621,0.00757996,0.002222574,0.003747968,0.0004457308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001323428,"about_ca_system_score_gemma":0.001183654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001800437,"about_ca_topic_score_gemma":0.001535348,"domain_scores_codex":[0.9984176,0.0006336678,0.00007909257,0.0002881782,0.0004588198,0.0001225675],"domain_scores_gemma":[0.9940252,0.004437894,0.0005831966,0.0003901937,0.0003100751,0.0002534331],"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.0002042955,0.0001835526,0.0004862693,0.0003603371,0.00008751558,0.0001681802,0.0001433363,0.3928778,0.001232982,0.5328387,0.01045799,0.06095896],"study_design_scores_gemma":[0.00003559254,0.0000276556,0.0002319263,0.00002476735,0.00002203694,0.0001548608,0.00004071803,0.5138286,0.0002524612,0.480693,0.004668837,0.00001945087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05027585,0.00675537,0.9160095,0.003274437,0.0003085441,0.00006524428,0.0005294501,0.0001531913,0.02262838],"genre_scores_gemma":[0.5958053,0.008354646,0.3753563,0.0008041437,0.001670447,0.0003124748,0.001043141,0.0003514914,0.01630199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003491195,"threshold_uncertainty_score":0.01167923,"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."}}