{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001644348,0.0005773473,0.0005011432,0.0005316822,0.001247048,0.0005354494,0.001167986,0.0002023574,0.00001232978],"category_scores_gemma":[0.00006998628,0.0004888626,0.0002937192,0.001736364,0.0002113499,0.0009749073,0.0002406312,0.0004561238,0.00003158544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002294113,"about_ca_system_score_gemma":0.0001710092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000953799,"about_ca_topic_score_gemma":0.0001738036,"domain_scores_codex":[0.9956868,0.00009008035,0.0007481955,0.001314397,0.0009491385,0.001211381],"domain_scores_gemma":[0.9971563,0.0005007719,0.0003937767,0.001147083,0.0004421515,0.0003598915],"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.00168982,0.004454155,0.00590181,0.001668858,0.001978773,0.0003114214,0.01278887,0.06445301,0.0136921,0.4038747,0.007499862,0.4816866],"study_design_scores_gemma":[0.004418265,0.003657773,0.003181885,0.0003333905,0.0001163565,0.0002299515,0.0004856153,0.9389687,0.006349889,0.01858553,0.02184885,0.001823757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003404912,0.00009437509,0.9862601,0.001394192,0.001076115,0.001634218,0.00006149506,0.0006349487,0.005439672],"genre_scores_gemma":[0.1903277,0.00004496747,0.8016874,0.0006087736,0.001297874,0.001029097,0.0002865407,0.0001764615,0.004541162],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8745157,"threshold_uncertainty_score":0.9997563,"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."}}