{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009233596,0.001232509,0.001661575,0.003049236,0.001806967,0.002411118,0.002929427,0.002084917,0.01896055],"category_scores_gemma":[0.004444561,0.0008601676,0.001306387,0.003925453,0.0008960479,0.002985817,0.001666542,0.001557094,0.003465829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002685661,"about_ca_system_score_gemma":0.002660315,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00689727,"about_ca_topic_score_gemma":0.009010439,"domain_scores_codex":[0.9990273,0.000312164,0.00003627827,0.0001196448,0.0002928783,0.0002118101],"domain_scores_gemma":[0.9978895,0.001327067,0.0001051683,0.0002446146,0.000279141,0.0001544633],"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.0009372137,0.0005883641,0.0007319466,0.0006792611,0.0001349698,0.0002758796,0.0002323485,0.4248541,0.00503424,0.05502602,0.03903997,0.4724658],"study_design_scores_gemma":[0.0002261531,0.0002912,0.0003004669,0.00008739643,0.00009286583,0.0001300099,0.00009752948,0.9364215,0.002673084,0.04787636,0.01175416,0.00004927774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05236415,0.002722305,0.9097356,0.00135714,0.0006548089,0.0007036997,0.001322546,0.003519027,0.02762069],"genre_scores_gemma":[0.2299566,0.001079383,0.7447876,0.0004604895,0.0003037392,0.0005576915,0.001880714,0.0006741661,0.0202996],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01896055,"threshold_uncertainty_score":0.0634293,"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."}}