{"id":"W2550943709","doi":"","title":"A Pruning based Ant Colony Algorithm for Minimum Vertex Cover Problem.","year":2009,"lang":"en","type":"article","venue":"IJCCI","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Vertex cover; Tree traversal; Graph traversal; Algorithm; Vertex (graph theory); Feedback vertex set; Edge cover; Pruning; Mathematics; Cardinality (data modeling); Ant colony optimization algorithms; Reachability; Computer science; Graph; Combinatorics; Mathematical optimization; Approximation algorithm; Data mining","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.0004421987,0.0005727515,0.0009796713,0.0009795374,0.0005108865,0.0006138257,0.001270773,0.001073806,0.001134924],"category_scores_gemma":[0.001720194,0.0003293916,0.0005548064,0.001122173,0.0003603816,0.0006716361,0.0005896611,0.0007355977,0.0003055504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005034728,"about_ca_system_score_gemma":0.0009083447,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003084399,"about_ca_topic_score_gemma":0.003515841,"domain_scores_codex":[0.999556,0.0001293534,0.00002027157,0.00006087961,0.0001936886,0.00003986106],"domain_scores_gemma":[0.9995261,0.0002440794,0.00006290802,0.00005249961,0.00008765782,0.00002670332],"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.00009924534,0.000126822,0.001044886,0.0001642592,0.00009920578,0.000186827,0.00009651146,0.7297752,0.009040869,0.01675458,0.00423131,0.2383802],"study_design_scores_gemma":[0.00002230342,0.00004589315,0.0001466861,0.00001052997,0.00001237762,0.0001088096,0.00001197223,0.9921984,0.001030888,0.003599994,0.002806079,0.000006190384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02072017,0.0007988769,0.9718161,0.0002653744,0.00009126197,0.0001867456,0.0000816449,0.0006318781,0.005407869],"genre_scores_gemma":[0.2339927,0.0004779448,0.7614166,0.0001483704,0.00004546244,0.0003484343,0.0002846181,0.00008896828,0.003196916],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003084399,"threshold_uncertainty_score":0.006132901,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01345453991789349,"score_gpt":0.2624972349315403,"score_spread":0.2490426950136468,"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."}}