{"id":"W2095553101","doi":"10.1016/j.orl.2006.03.014","title":"A list heuristic for vertex cover","year":2006,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Vertex cover; Vertex (graph theory); Heuristic; Cover (algebra); Sequence (biology); Degree (music); Mathematics; Approximation algorithm; Order (exchange); Discrete mathematics; Mathematical optimization; Graph; Physics","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":[],"consensus_categories":[],"category_scores_codex":[0.0007907738,0.00007716419,0.00008163972,0.0002423848,0.0006854535,0.0009095464,0.0006124263,0.00003212672,0.0001056301],"category_scores_gemma":[0.0002288619,0.00007198337,0.00004446897,0.0006144448,0.0001121415,0.000529926,0.0001329484,0.0001772606,0.0002588692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008920071,"about_ca_system_score_gemma":0.0001418472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000322417,"about_ca_topic_score_gemma":0.0001145389,"domain_scores_codex":[0.9983925,0.0001787815,0.0001755424,0.0003170246,0.0004954627,0.0004406872],"domain_scores_gemma":[0.9988736,0.0002369567,0.000008137975,0.0004195367,0.0003732904,0.00008851058],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007970447,0.0001468383,0.00007646306,0.00002148035,0.00001128009,0.00001115353,0.0002527406,0.1894481,0.01900394,0.3096796,0.4799956,0.001344789],"study_design_scores_gemma":[0.000454532,0.00006488632,0.0002097021,0.000009704652,0.00000101243,0.000003367719,0.000009644294,0.9215925,0.000603679,0.0008307649,0.07609924,0.0001210072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004689885,0.00002861225,0.9545683,0.03589936,0.0001240596,0.0006738988,0.00001293635,0.00008528293,0.003917651],"genre_scores_gemma":[0.803899,0.00002198443,0.1746785,0.004239854,0.0002736718,0.0007558506,0.0001303849,0.00003127751,0.01596941],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7992092,"threshold_uncertainty_score":0.8770776,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05137916255268932,"score_gpt":0.3526719316432403,"score_spread":0.301292769090551,"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."}}