{"id":"W4389488492","doi":"10.1007/978-3-031-49611-0_33","title":"An Approximation Algorithm for Covering Vertices by $$4^+$$-Paths","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Disjoint sets; Approximation algorithm; Vertex cover; Vertex (graph theory); Algorithm; Combinatorics; Computer science; Graph; Matching (statistics); Running time; Path (computing); Mathematics","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.000998304,0.002871283,0.002337142,0.001884315,0.00159936,0.003032031,0.005708191,0.003017665,0.02830885],"category_scores_gemma":[0.004244365,0.001427837,0.003007085,0.005353664,0.001095299,0.005317988,0.003890652,0.002981327,0.005835082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003668786,"about_ca_system_score_gemma":0.004319644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009633489,"about_ca_topic_score_gemma":0.0128867,"domain_scores_codex":[0.9984061,0.0002214329,0.0000949625,0.0004408973,0.0004467394,0.0003897463],"domain_scores_gemma":[0.9975798,0.001120213,0.0001357083,0.0007097563,0.0002596827,0.0001948466],"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.001471333,0.0009103771,0.001731846,0.0008468932,0.000224191,0.0001992494,0.0003835701,0.1429117,0.01200038,0.05082553,0.05776973,0.7307253],"study_design_scores_gemma":[0.0005904335,0.0003414273,0.001117574,0.0001206839,0.0002493166,0.0005510202,0.0003123046,0.863238,0.008919872,0.1015428,0.0229523,0.00006408765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08778123,0.001256124,0.8486252,0.002025849,0.0005794709,0.001008233,0.003494764,0.009493013,0.04573603],"genre_scores_gemma":[0.1093734,0.0004869498,0.8682087,0.000427591,0.0001356547,0.0005370589,0.005108001,0.0008336742,0.01488899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02830885,"threshold_uncertainty_score":0.09470248,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02366334272043781,"score_gpt":0.2625619495429864,"score_spread":0.2388986068225486,"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."}}