{"id":"W2338410001","doi":"10.1016/j.tcs.2016.04.005","title":"Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Vertex cover; Cover (algebra); Vertex (graph theory); Mathematics; Edge cover; Approximation algorithm; Dual (grammatical number); Covering problems; Combinatorics; Set cover problem; Mathematical optimization; Algorithm; Computer science; Graph; Set (abstract data type)","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.002074476,0.0003534487,0.0003637181,0.0003207285,0.0007234496,0.0004327339,0.002087154,0.0001038259,0.00002103286],"category_scores_gemma":[0.00009916071,0.0002241446,0.0001193323,0.001243942,0.003372088,0.001613969,0.0008871865,0.0001873587,0.00001656961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001522018,"about_ca_system_score_gemma":0.000280236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005432545,"about_ca_topic_score_gemma":4.529752e-7,"domain_scores_codex":[0.9963026,0.0001199059,0.0004225969,0.001187519,0.001055147,0.0009122028],"domain_scores_gemma":[0.9975629,0.0003593485,0.0001636646,0.001067797,0.0005681481,0.0002780892],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000282429,0.0001199057,0.00003750563,0.00004256125,0.00001377154,0.000008293905,0.0002618555,0.0007290224,0.008577956,0.9501258,0.00001583504,0.04003932],"study_design_scores_gemma":[0.0005728737,0.0005291128,0.0001087764,0.0001702445,0.00001019362,0.0001336038,0.000003126694,0.7429166,0.03194693,0.2230352,0.0001802403,0.0003930873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01156576,0.00002102102,0.9856527,0.0007498789,0.000380821,0.001127088,0.0000118455,0.0003391709,0.0001516959],"genre_scores_gemma":[0.4361901,0.000002789346,0.5634573,0.0001458269,0.0001118011,0.00006638934,0.000001316456,0.00001498334,0.00000949889],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7421876,"threshold_uncertainty_score":0.9993402,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02720583563305955,"score_gpt":0.2631464983360515,"score_spread":0.2359406627029919,"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."}}