{"id":"W2145866065","doi":"10.1007/s00453-012-9740-5","title":"Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Cover (algebra); Bounded function; Tree (set theory); Approximation algorithm; Theory of computation; Upper and lower bounds; Discrete mathematics; Graph; 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"],"consensus_categories":[],"category_scores_codex":[0.0005021424,0.0003907013,0.0003710169,0.0001432198,0.0006601274,0.0009549259,0.001283341,0.0001652953,0.00008031005],"category_scores_gemma":[0.00009075242,0.000261767,0.000202853,0.0005123771,0.0003150094,0.001194612,0.0004459006,0.0002816292,0.0001313369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006761979,"about_ca_system_score_gemma":0.0001011256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002621451,"about_ca_topic_score_gemma":0.00002214433,"domain_scores_codex":[0.9974835,0.00007951632,0.0004995798,0.0008207642,0.0004243887,0.0006922612],"domain_scores_gemma":[0.9975781,0.0007496623,0.0002310237,0.0009879546,0.0002676265,0.000185669],"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.00001139218,0.0001408887,0.00002029575,0.00005772498,0.0001329267,0.000001733166,0.0007339786,0.00002709396,0.0009500377,0.01432289,0.007635618,0.9759654],"study_design_scores_gemma":[0.001366268,0.000253162,0.00100775,0.00002342238,0.00003871504,0.00003456274,0.00005105123,0.8953127,0.001365671,0.06091336,0.03919886,0.000434469],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00122635,0.0005090857,0.9886507,0.005037098,0.0008219147,0.002366208,0.00003631702,0.0002658553,0.00108643],"genre_scores_gemma":[0.0646098,0.0001975699,0.9203507,0.002433082,0.001098115,0.002548042,0.0000726058,0.0001110577,0.008578989],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9755309,"threshold_uncertainty_score":0.9999834,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02354457203300562,"score_gpt":0.239021698037697,"score_spread":0.2154771260046914,"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."}}