{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001026865,0.001678157,0.001677114,0.001324639,0.001093848,0.002455098,0.003481481,0.002440007,0.01446437],"category_scores_gemma":[0.004451776,0.0008884358,0.001738686,0.002664834,0.0008383919,0.004374637,0.002446755,0.003649774,0.005564998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002671649,"about_ca_system_score_gemma":0.002993069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002995125,"about_ca_topic_score_gemma":0.005083207,"domain_scores_codex":[0.998504,0.0002436559,0.00009848044,0.0003826727,0.0005279149,0.0002433322],"domain_scores_gemma":[0.9982955,0.0006777773,0.0001647467,0.0004140811,0.0002814858,0.000166509],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001722165,0.0009056593,0.001501498,0.0005946725,0.0002303884,0.0001823571,0.0002675345,0.1471563,0.01654004,0.06180803,0.06175736,0.707334],"study_design_scores_gemma":[0.000640846,0.0003288524,0.001219848,0.00007396129,0.0001546378,0.0006007425,0.0001393526,0.858775,0.006916829,0.1104036,0.02066943,0.00007694125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05205631,0.001190149,0.9102406,0.002936946,0.0007163587,0.0003557752,0.001096028,0.004130193,0.02727763],"genre_scores_gemma":[0.1350274,0.0005047527,0.846656,0.0005297021,0.0003054119,0.0004203678,0.001817967,0.0003936393,0.01434493],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01446437,"threshold_uncertainty_score":0.04838818,"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."}}