{"id":"W3119461075","doi":"10.1109/access.2021.3051741","title":"A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem","year":2021,"lang":"en","type":"article","venue":"IEEE Access","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Computer science; Algorithm; Guided Local Search; Evolutionary algorithm; Benchmark (surveying); Vertex cover; Robustness (evolution); Local search (optimization); Memetic algorithm; Mathematical optimization; Combinatorial optimization; Best-first search; Search algorithm; Mathematics; Approximation algorithm; Beam search; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.0001833863,0.0001233165,0.000143129,0.00002956268,0.0001092135,0.0002031051,0.0001985817,0.00006336331,0.000054809],"category_scores_gemma":[0.00005906822,0.000101455,0.00003761224,0.0002155385,0.00002875215,0.0001776039,0.00004916024,0.0001090239,0.00000684074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002527363,"about_ca_system_score_gemma":0.0000264918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005800126,"about_ca_topic_score_gemma":0.00000388242,"domain_scores_codex":[0.9992904,0.00003713651,0.0001717819,0.0001857542,0.0001064407,0.0002084952],"domain_scores_gemma":[0.9991807,0.0004303632,0.00002861877,0.0002136514,0.00009552365,0.0000511651],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004361256,0.00002119048,0.0003068988,0.0001484226,0.000097511,0.00001149313,0.0002281194,0.852534,0.0004763779,0.00006064189,0.01082561,0.1352854],"study_design_scores_gemma":[0.0004151179,0.000007543811,0.000375094,0.0000280996,0.00004461468,0.00001679837,0.00001917341,0.9916972,0.003669624,0.0002024862,0.003379968,0.0001442945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002772689,0.0005978152,0.9945258,0.0001625233,0.0007232963,0.0002462579,0.00003047898,0.000138122,0.000803046],"genre_scores_gemma":[0.1356177,0.000516205,0.8593708,0.0006002384,0.000755531,0.0003054218,0.00003786044,0.0001994013,0.002596808],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1391632,"threshold_uncertainty_score":0.4137216,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02594190401154969,"score_gpt":0.279889774208004,"score_spread":0.2539478701964544,"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."}}