{"id":"W119341521","doi":"10.1007/978-3-642-40104-6_23","title":"Lift-and-Project Methods for Set Cover and Knapsack","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Knapsack problem; Cover (algebra); Set cover problem; Hierarchy; Rounding; Mathematics; Lift (data mining); Combinatorics; Approximation algorithm; Set (abstract data type); Function (biology); Discrete mathematics; Computer science; Mathematical optimization; Data mining","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.00138402,0.0005493104,0.0006348483,0.0007362376,0.0003798276,0.0009187529,0.002033677,0.0003218626,0.00002560185],"category_scores_gemma":[0.0001514023,0.0004833654,0.0001290672,0.0004542355,0.001112706,0.0006863193,0.001974755,0.0006125941,0.00001873614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008250391,"about_ca_system_score_gemma":0.0003069333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004153005,"about_ca_topic_score_gemma":0.00001094337,"domain_scores_codex":[0.996676,0.00006648775,0.0004452239,0.001717791,0.0004404878,0.0006540458],"domain_scores_gemma":[0.9967494,0.001565392,0.0002218278,0.001060092,0.0002223096,0.000180988],"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.000003641559,0.000009604723,0.000007790383,0.00006587386,0.00001523588,0.000006111742,0.0006557973,0.0002493534,0.00004559114,0.05286014,0.0001527787,0.9459281],"study_design_scores_gemma":[0.0002706418,0.0002047095,0.00004024912,0.0001515456,0.000009961257,0.00008210589,2.040912e-7,0.5683868,0.000296417,0.4023722,0.02763708,0.0005480435],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000288936,0.001446486,0.9940074,0.0007446604,0.001353635,0.0008178157,0.00001555149,0.0001252463,0.001460294],"genre_scores_gemma":[0.001090446,0.0001750485,0.9959552,0.001706789,0.0003202671,0.00003383365,0.00000479666,0.00002925179,0.0006843483],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.94538,"threshold_uncertainty_score":0.9997618,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04867186601485612,"score_gpt":0.3316827942475645,"score_spread":0.2830109282327083,"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."}}