{"id":"W2055000959","doi":"10.1145/1435375.1435381","title":"Distributed weighted vertex cover via maximal matchings","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Vertex cover; Combinatorics; Mathematics; Vertex (graph theory); Feedback vertex set; Edge cover; Binary logarithm; Upper and lower bounds; Undirected graph; Matching (statistics); Minimum weight; Cover (algebra); Graph; Discrete mathematics","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.001185707,0.0006925328,0.00135806,0.0009243283,0.001065081,0.001293141,0.002200465,0.0009552799,0.003338499],"category_scores_gemma":[0.005424391,0.0004634,0.0007463294,0.001861806,0.0009795121,0.004392488,0.003114998,0.0007794916,0.000583633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001354122,"about_ca_system_score_gemma":0.001042607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001417735,"about_ca_topic_score_gemma":0.001913789,"domain_scores_codex":[0.998401,0.0003747191,0.00007237514,0.0004518359,0.0004224011,0.000277721],"domain_scores_gemma":[0.9981945,0.0009296642,0.0001721511,0.0004429348,0.0001414419,0.0001191933],"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.00124651,0.0002455767,0.001634706,0.0003610749,0.0001622788,0.0002696535,0.0002919,0.6310591,0.01902822,0.1053953,0.004622537,0.2356832],"study_design_scores_gemma":[0.00007080343,0.00008458221,0.0001989031,0.00001367346,0.00002466137,0.0001059872,0.00004462371,0.8776768,0.005938052,0.1136289,0.002199656,0.00001334353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.103734,0.0003846555,0.8891002,0.0003580137,0.00005455487,0.0001726887,0.0002119575,0.001047668,0.004936191],"genre_scores_gemma":[0.7290297,0.0002273578,0.2661659,0.0001254781,0.00006230323,0.0002672425,0.0005093416,0.0001412401,0.003471421],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003338499,"threshold_uncertainty_score":0.01116836,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02367927571191205,"score_gpt":0.2385259495041349,"score_spread":0.2148466737922228,"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."}}