{"id":"W1974542877","doi":"10.5555/1283383.1283520","title":"Approximation algorithms for prize collecting forest problems with submodular penalty functions","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Submodular set function; Rounding; Penalty method; Steiner tree problem; Approximation algorithm; Mathematical optimization; Function (biology); Computer science; Mathematics; Algorithm; Minification; Dual (grammatical number); Tree (set theory); Combinatorics","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.002688178,0.001482549,0.002007182,0.000811654,0.0008326835,0.001838719,0.002557353,0.001723316,0.005032488],"category_scores_gemma":[0.006358935,0.0005984383,0.001047519,0.002350039,0.0007701196,0.003603783,0.00163146,0.002595434,0.0007773415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001550118,"about_ca_system_score_gemma":0.001456295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002584316,"about_ca_topic_score_gemma":0.00418009,"domain_scores_codex":[0.9988458,0.0004978725,0.00004299002,0.000164021,0.0002092823,0.0002399017],"domain_scores_gemma":[0.9976171,0.001682878,0.0002104496,0.0002148544,0.0001516033,0.000123015],"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.0004116482,0.0003811402,0.001089875,0.0003730544,0.00009824281,0.0001046891,0.0001630447,0.7495535,0.001125292,0.09028198,0.01159161,0.1448259],"study_design_scores_gemma":[0.00004274414,0.00004548112,0.00009613809,0.00001720526,0.00001341021,0.00004804258,0.00003809763,0.9460657,0.0002558499,0.052251,0.001118372,0.000008048814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03614679,0.001119713,0.9547768,0.0006709049,0.00009652696,0.0001427052,0.0002399686,0.0005733344,0.006233307],"genre_scores_gemma":[0.4168906,0.001129792,0.5726752,0.0004079121,0.0002181132,0.0004126112,0.000826919,0.0003157993,0.007123169],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005032488,"threshold_uncertainty_score":0.01683533,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03007951308552398,"score_gpt":0.2687336219725512,"score_spread":0.2386541088870272,"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."}}