{"id":"W2012511041","doi":"10.1007/s10107-005-0693-1","title":"A 2 + ɛ approximation algorithm for the k-MST problem","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Approximation algorithm; Minimum spanning tree; Combinatorics; Triangle inequality; Spanning tree; k-minimum spanning tree; Graph; Algorithm; Discrete mathematics; Tree structure; K-ary 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.0007423444,0.0001403623,0.0001563598,0.00004950767,0.0003744038,0.0004100189,0.0008205739,0.00004954393,0.00001766888],"category_scores_gemma":[0.00007087921,0.00009225602,0.000136295,0.0003166151,0.00009533142,0.0003466285,0.0001923512,0.0001368664,0.00006297132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002925574,"about_ca_system_score_gemma":0.00002020608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001694216,"about_ca_topic_score_gemma":0.00000167404,"domain_scores_codex":[0.9987273,0.00002649578,0.0003043892,0.0002807365,0.0002852392,0.0003757945],"domain_scores_gemma":[0.9988047,0.0005147026,0.00008284974,0.0004528737,0.00007402059,0.00007088619],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[4.495489e-7,0.00008841885,3.769631e-7,0.00003071911,0.00001051664,2.980025e-7,0.0004110701,0.00001313327,0.000003997817,0.3011221,0.000120744,0.6981982],"study_design_scores_gemma":[0.0001776751,0.00004289212,0.000002769302,0.00002417023,0.00001018245,0.00001887003,0.0000499313,0.7495669,0.000148253,0.1973564,0.0524884,0.0001135701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002552336,0.0001236077,0.9938486,0.003637896,0.00006949189,0.001020137,0.000001337942,0.0003073866,0.0009659894],"genre_scores_gemma":[0.004447914,0.000002166517,0.9944142,0.0001802268,0.0002101988,0.0005267875,0.000002030287,0.000011582,0.0002048946],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7495537,"threshold_uncertainty_score":0.3953822,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0293068881180488,"score_gpt":0.274109404855013,"score_spread":0.2448025167369642,"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."}}