{"id":"W1519655831","doi":"10.1007/11523468_84","title":"A Better Approximation Ratio for the Vertex Cover Problem","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Cover (algebra); Combinatorics; Vertex cover; Mathematics; Relaxation (psychology); Vertex (graph theory); Binary logarithm; Approximation algorithm; Discrete mathematics; Graph","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.006981922,0.004456515,0.005215267,0.003779408,0.002350057,0.009643315,0.008944208,0.007045251,0.03434697],"category_scores_gemma":[0.03646773,0.001561345,0.004249405,0.007595561,0.002717489,0.02059157,0.005182549,0.0101676,0.006915081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007400372,"about_ca_system_score_gemma":0.003723596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003925802,"about_ca_topic_score_gemma":0.004193768,"domain_scores_codex":[0.9874227,0.003884336,0.0004565709,0.002363258,0.003751588,0.002121535],"domain_scores_gemma":[0.9686255,0.01905498,0.0009575153,0.008265772,0.001670359,0.001425931],"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.007398399,0.00245219,0.003136677,0.001577022,0.000602442,0.0004372121,0.0005363638,0.1677748,0.02211033,0.1960667,0.1426876,0.4552203],"study_design_scores_gemma":[0.0009878601,0.0006145087,0.001634069,0.0002176659,0.0005179066,0.001164837,0.0002364144,0.6637163,0.008259487,0.2957323,0.02677687,0.0001417607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1975519,0.03002475,0.5938643,0.02880321,0.007434312,0.0006165865,0.003909091,0.009596889,0.1281991],"genre_scores_gemma":[0.5271217,0.006783166,0.4115467,0.006125395,0.006272369,0.0006471101,0.00510656,0.004460366,0.03193676],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03434697,"threshold_uncertainty_score":0.1149021,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02102852362307598,"score_gpt":0.2414040172628108,"score_spread":0.2203754936397349,"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."}}