{"id":"W2403213103","doi":"","title":"A better approximation ratio for the Vertex Cover problem","year":2004,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Vertex cover; Combinatorics; Cover (algebra); Mathematics; Relaxation (psychology); Vertex (graph theory); Approximation algorithm; Set cover problem; Set (abstract data type); Edge cover; Maximum cut; Discrete mathematics; Computer science; 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.004521724,0.003377669,0.002613291,0.002022032,0.001022108,0.004721929,0.003944766,0.004189739,0.01953815],"category_scores_gemma":[0.02214795,0.0007927484,0.002532978,0.003390584,0.001692903,0.01069372,0.003487252,0.008620999,0.004506872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003120823,"about_ca_system_score_gemma":0.002027574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002211386,"about_ca_topic_score_gemma":0.002333749,"domain_scores_codex":[0.9935424,0.002006024,0.0001823496,0.001502969,0.001732599,0.001033504],"domain_scores_gemma":[0.9859562,0.008332673,0.0006320046,0.003633895,0.000831858,0.0006133245],"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.003171788,0.002001914,0.002627518,0.001120072,0.0004052195,0.0004513369,0.00053353,0.3023639,0.02512754,0.2653547,0.07377721,0.3230653],"study_design_scores_gemma":[0.0002994091,0.000341816,0.000531666,0.00008537971,0.0001207245,0.0006105879,0.0001093486,0.8178581,0.005264557,0.1606978,0.01403102,0.00004958308],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07774302,0.005266585,0.8591011,0.01168622,0.001552792,0.0002308758,0.001129166,0.003221991,0.04006816],"genre_scores_gemma":[0.4604861,0.002706213,0.50622,0.004341585,0.002442151,0.0005293281,0.002971324,0.002280294,0.018023],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01953815,"threshold_uncertainty_score":0.06536168,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02213714143351398,"score_gpt":0.2405365403831179,"score_spread":0.2183993989496039,"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."}}