{"id":"W198434069","doi":"10.1007/978-3-642-22935-0_26","title":"Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cover (algebra); Combinatorics; Bounded function; Tree (set theory); Mathematics; Approximation algorithm; Discrete mathematics; Upper and lower bounds; Graph; Vertex cover; Algorithm","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.003496048,0.002584131,0.003592179,0.002516596,0.001414221,0.004346739,0.007166805,0.002782877,0.01276208],"category_scores_gemma":[0.01582417,0.001440749,0.002820413,0.00657345,0.001426423,0.01011502,0.004006267,0.006715784,0.00267065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005491039,"about_ca_system_score_gemma":0.002892961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005308656,"about_ca_topic_score_gemma":0.008354479,"domain_scores_codex":[0.9964605,0.0008826992,0.0001800443,0.0006163232,0.001274747,0.0005856645],"domain_scores_gemma":[0.9913154,0.005593882,0.0004004872,0.001673111,0.0006630677,0.0003540225],"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.001759296,0.0007874398,0.001388355,0.0009064275,0.0002007986,0.0001105551,0.0003875735,0.2907333,0.003700348,0.1454678,0.04689814,0.5076599],"study_design_scores_gemma":[0.0001628999,0.0000865305,0.0004127923,0.0000589748,0.00009844993,0.0001367178,0.00006657327,0.866586,0.001385619,0.124913,0.006067161,0.00002518376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03767296,0.006020466,0.9298982,0.00187511,0.0005426738,0.0002727451,0.001147346,0.002688457,0.01988203],"genre_scores_gemma":[0.2081616,0.002721466,0.7698247,0.0006288404,0.000866089,0.0005953161,0.003238399,0.001115198,0.01284831],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01276208,"threshold_uncertainty_score":0.04269338,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03348342249655765,"score_gpt":0.2419623660101153,"score_spread":0.2084789435135577,"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."}}