{"id":"W2024624524","doi":"10.1016/s0304-3975(03)00363-3","title":"An asymptotic fully polynomial time approximation scheme for bin covering","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"","keywords":"Bin packing problem; Bin; Mathematics; Polynomial-time approximation scheme; Scheme (mathematics); Time complexity; Approximation algorithm; Polynomial; Combinatorics; Dual (grammatical number); Mathematical optimization; Discrete mathematics; Algorithm; Mathematical analysis","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":[],"consensus_categories":[],"category_scores_codex":[0.0005838251,0.000101848,0.0001004515,0.00008829785,0.0001443516,0.0001902198,0.0002582193,0.00003962737,0.00009077325],"category_scores_gemma":[0.00004212594,0.00009718785,0.00002627849,0.0003142588,0.0003364485,0.0002876384,0.00002114976,0.00006559361,0.00005242779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004087485,"about_ca_system_score_gemma":0.000029903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.537321e-7,"about_ca_topic_score_gemma":4.531448e-8,"domain_scores_codex":[0.9991657,0.00002422965,0.0001441761,0.0002122487,0.0001679671,0.0002857274],"domain_scores_gemma":[0.9995338,0.00005760781,0.00001599157,0.0002072621,0.00005820579,0.0001271481],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000620102,0.0000263596,0.00002168149,0.00002620972,0.000003756329,3.315545e-7,0.0002012105,0.2501109,0.01322657,0.7330534,0.00008788722,0.003235423],"study_design_scores_gemma":[0.0002058185,0.00007887188,0.00002791758,0.00001197988,0.000002624772,0.000005203886,0.000001740526,0.9837121,0.01023853,0.005362841,0.0002114315,0.0001409024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03940375,0.000006670499,0.9550976,0.00002697901,0.0003298811,0.0001756357,0.00000217402,0.0002578326,0.004699485],"genre_scores_gemma":[0.7710934,6.549994e-7,0.2287654,0.00005758834,0.00005343822,0.000005992489,0.000003083178,0.00001233329,0.000008090927],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7336012,"threshold_uncertainty_score":0.3963206,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006235549382664906,"score_gpt":0.2174321802765514,"score_spread":0.2111966308938865,"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."}}