{"id":"W1750858516","doi":"10.1007/978-3-319-08783-2_29","title":"Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Vertex cover; Approximation algorithm; Vertex (graph theory); Dual (grammatical number); Cover (algebra); Time complexity; Computer science; Edge cover; Mathematics; Algorithm; Mathematical optimization; Combinatorics; Graph","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.002747728,0.002600569,0.002562871,0.001297524,0.0009922973,0.003961766,0.003949597,0.002701775,0.01386343],"category_scores_gemma":[0.007863377,0.00133864,0.0014891,0.003109685,0.001184697,0.004436641,0.00278492,0.006199147,0.002722975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00300723,"about_ca_system_score_gemma":0.002686525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002969341,"about_ca_topic_score_gemma":0.004656007,"domain_scores_codex":[0.998534,0.0004882058,0.00005556225,0.0003006203,0.0003298389,0.0002918173],"domain_scores_gemma":[0.9971483,0.001804386,0.0001655595,0.0003887972,0.0002612614,0.0002316602],"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.0008743316,0.001223174,0.001052068,0.0008538612,0.0001697852,0.0001282501,0.0002120533,0.4517719,0.001902419,0.1472851,0.0595738,0.3349534],"study_design_scores_gemma":[0.0001118858,0.00005733757,0.0001168482,0.00006593392,0.00002725406,0.00007454368,0.00006114925,0.904538,0.0005011425,0.09122707,0.003207153,0.00001158106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02569718,0.003770436,0.9381109,0.001796623,0.0005167872,0.0003242417,0.0008032386,0.001459701,0.02752075],"genre_scores_gemma":[0.2318113,0.001901555,0.7447509,0.0007986494,0.0005302525,0.0007365713,0.001988135,0.001028367,0.01645425],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01386343,"threshold_uncertainty_score":0.04637772,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02414370419358935,"score_gpt":0.2378230700973678,"score_spread":0.2136793659037785,"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."}}