{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003288381,0.002479568,0.002832345,0.001685922,0.0009762704,0.003901753,0.003709765,0.002888603,0.009516623],"category_scores_gemma":[0.009707417,0.001343982,0.001624151,0.003080255,0.0012512,0.004597943,0.002858022,0.00548745,0.001614961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003338085,"about_ca_system_score_gemma":0.003303661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004144427,"about_ca_topic_score_gemma":0.006004652,"domain_scores_codex":[0.9983659,0.0005671472,0.0000571138,0.0002972822,0.0003624709,0.0003500326],"domain_scores_gemma":[0.9956676,0.002914518,0.0002825997,0.0004626571,0.0003484031,0.0003242492],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008074614,0.001118794,0.001327453,0.0006367448,0.0001841644,0.000132978,0.0001985552,0.6853116,0.001659102,0.09129788,0.02638313,0.1909422],"study_design_scores_gemma":[0.00007045793,0.00004156431,0.00008001499,0.00003057491,0.00002232946,0.00003936664,0.00003717474,0.9630836,0.0002766704,0.03526084,0.001049932,0.000007554223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03013801,0.001867845,0.9514575,0.001627735,0.0003083392,0.0002985842,0.0004759374,0.001118031,0.01270796],"genre_scores_gemma":[0.316011,0.001051176,0.6699507,0.0007242805,0.0003769506,0.0007435888,0.001257863,0.0006567918,0.009227608],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009516623,"threshold_uncertainty_score":0.03183627,"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."}}