{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001288541,0.0007097353,0.0006314467,0.0005345825,0.0007565801,0.001156765,0.003527981,0.0003801579,0.00002709239],"category_scores_gemma":[0.0001058515,0.0004832558,0.000241194,0.0005692173,0.001504937,0.0009195873,0.001424482,0.0007456223,0.00002034246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001799897,"about_ca_system_score_gemma":0.0004314887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006466713,"about_ca_topic_score_gemma":0.0001340496,"domain_scores_codex":[0.9958422,0.0000420133,0.0006570943,0.001804291,0.0008209842,0.0008334632],"domain_scores_gemma":[0.9962047,0.001199619,0.0004564859,0.001627171,0.0003319661,0.0001801127],"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":[0.00001581486,0.00004175444,0.0000074415,0.00007999982,0.00003745539,0.000006340635,0.001217155,0.0008387163,0.00007890411,0.03428132,0.00007732823,0.9633178],"study_design_scores_gemma":[0.0005229505,0.0002682554,0.00008078056,0.0001353543,0.00002239697,0.00004542186,2.425997e-7,0.6563643,0.0004351534,0.3334266,0.008167784,0.0005307581],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001610731,0.0009199909,0.9922137,0.0009677133,0.002008944,0.00168804,0.00002545816,0.0001585621,0.002001456],"genre_scores_gemma":[0.01166503,0.0002224068,0.9819972,0.002059368,0.0009397754,0.0001870912,0.00001961889,0.00008370186,0.002825795],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.962787,"threshold_uncertainty_score":0.9998801,"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."}}