{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001537403,0.0008986628,0.0009259885,0.0009298181,0.0005983186,0.0008339459,0.00320214,0.0004314854,0.00001834261],"category_scores_gemma":[0.0001058628,0.0007617335,0.0002578824,0.0007732555,0.001172931,0.0008981696,0.001058706,0.0009029635,0.0000330105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002932905,"about_ca_system_score_gemma":0.0006075349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002530513,"about_ca_topic_score_gemma":0.00003868713,"domain_scores_codex":[0.9940989,0.00006021166,0.0007629348,0.002330333,0.001667326,0.00108032],"domain_scores_gemma":[0.9960483,0.000616061,0.000527707,0.001851627,0.0007058771,0.0002504669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000439715,0.0001211979,0.00004347642,0.0004609793,0.00008104362,0.00004896105,0.001484623,0.1525106,0.0001171681,0.116825,0.00009539066,0.7281675],"study_design_scores_gemma":[0.0007374171,0.0006565426,0.00005250153,0.0004807635,0.00002143545,0.0001079232,2.431358e-7,0.8195897,0.0009342709,0.1709401,0.00554345,0.0009356483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000089858,0.0002961127,0.9948977,0.0006957842,0.001474852,0.001564456,0.00002514856,0.0003007786,0.0006553162],"genre_scores_gemma":[0.02757687,0.0000360801,0.9695538,0.001161603,0.0008144106,0.0001062578,0.00005613529,0.00008763823,0.0006071982],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7272319,"threshold_uncertainty_score":0.9994833,"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."}}