{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004585013,0.002361436,0.003174567,0.002699788,0.001450919,0.004744292,0.006672211,0.002882036,0.01017104],"category_scores_gemma":[0.02402459,0.001274258,0.002624993,0.005479043,0.001795481,0.01172498,0.004441814,0.00648113,0.001720759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005555797,"about_ca_system_score_gemma":0.003373533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005012253,"about_ca_topic_score_gemma":0.008408488,"domain_scores_codex":[0.9956683,0.001361877,0.0002021009,0.0007279631,0.001346636,0.0006930279],"domain_scores_gemma":[0.9849182,0.01053705,0.0007925817,0.002273247,0.000882919,0.0005961409],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002171026,0.0009802533,0.003203803,0.0009125551,0.0002526304,0.0001411246,0.0005599051,0.4057687,0.003697057,0.1963114,0.0360065,0.3499952],"study_design_scores_gemma":[0.0001431957,0.00007676089,0.0004688656,0.00004430264,0.00009739319,0.0001050536,0.00006870631,0.8628972,0.001035167,0.1315625,0.003479321,0.0000216565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05919836,0.004702439,0.9138435,0.00292172,0.0004310739,0.0002427183,0.0009970166,0.001721357,0.01594185],"genre_scores_gemma":[0.3678501,0.002386152,0.6123803,0.0008549765,0.001009415,0.0006043062,0.002850003,0.0009654165,0.01109945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01017104,"threshold_uncertainty_score":0.04031026,"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."}}