{"id":"W2156885983","doi":"10.1007/978-3-319-18263-6_22","title":"Primal-Dual Algorithms for Precedence Constrained Covering Problems","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Knapsack problem; Combinatorics; Mathematics; Cover (algebra); Bounded function; Upper and lower bounds; Antichain; Order (exchange); Discrete mathematics; Integer (computer science); Algorithm; Partially ordered set; Computer science","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.001847082,0.001829199,0.00163548,0.0009724944,0.0007328165,0.002281415,0.002062033,0.001672522,0.009753322],"category_scores_gemma":[0.005098815,0.001255418,0.00115256,0.002423341,0.001050521,0.002301864,0.002499635,0.004444253,0.001539014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001502364,"about_ca_system_score_gemma":0.001500661,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002004451,"about_ca_topic_score_gemma":0.002312853,"domain_scores_codex":[0.9992155,0.0003113628,0.00003144356,0.00009520404,0.0002373336,0.0001092619],"domain_scores_gemma":[0.998582,0.000963368,0.00007733947,0.0001292197,0.0001500352,0.00009802018],"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.0001773292,0.0002876475,0.0003019138,0.0004457668,0.00006450441,0.0000805611,0.0001193472,0.608785,0.001180511,0.185399,0.01621209,0.1869464],"study_design_scores_gemma":[0.00003836133,0.00002611902,0.00006632827,0.00004601774,0.00001174205,0.00004599721,0.00002231772,0.8979918,0.0003617951,0.09767019,0.00371161,0.000007571889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007170824,0.002042084,0.9732945,0.0003978161,0.0002033761,0.00007319773,0.0001385901,0.0002834957,0.01639626],"genre_scores_gemma":[0.1905615,0.003231777,0.7867407,0.0003238733,0.0003985526,0.0004367655,0.0005614766,0.0006073036,0.01713817],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009753322,"threshold_uncertainty_score":0.03262812,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05693307988904808,"score_gpt":0.2951510142718861,"score_spread":0.238217934382838,"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."}}