{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002060024,0.001408441,0.00211787,0.001371705,0.001389075,0.003444418,0.004097988,0.00183038,0.01083903],"category_scores_gemma":[0.0105408,0.0008319225,0.001289395,0.004130448,0.001304743,0.006923563,0.005362665,0.003107945,0.00275473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004384103,"about_ca_system_score_gemma":0.003884002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005718039,"about_ca_topic_score_gemma":0.008164953,"domain_scores_codex":[0.9964709,0.0006635631,0.0001783437,0.000611849,0.001314137,0.0007612383],"domain_scores_gemma":[0.9941959,0.002035724,0.0002612696,0.002743211,0.0004796072,0.0002842423],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002993218,0.0006760439,0.001498995,0.0005279077,0.0001351725,0.0001325401,0.0004983675,0.2685516,0.01819327,0.1353496,0.03530511,0.5361381],"study_design_scores_gemma":[0.0001395769,0.0001034161,0.0003145827,0.00002721753,0.00005665463,0.0001152541,0.00005545454,0.908615,0.003115655,0.08278948,0.004644193,0.00002353613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04453238,0.0009267079,0.9336464,0.000800242,0.0001959043,0.0002479307,0.0008302216,0.00460509,0.01421514],"genre_scores_gemma":[0.3800423,0.0006543436,0.6052738,0.000511391,0.0002454563,0.0004656379,0.001825466,0.0007809321,0.01020062],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01083903,"threshold_uncertainty_score":0.03626025,"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."}}