{"id":"W2046102647","doi":"10.1016/j.tcs.2009.08.006","title":"A sublinear-time approximation scheme for bin packing","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Bin packing problem; Sublinear function; Mathematics; Constant (computer programming); Approximation algorithm; Combinatorics; Exponential function; Sampling (signal processing); Function (biology); Running time; Bin; Set (abstract data type); Discrete mathematics; Algorithm; Computer science; 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.001914757,0.001877483,0.002475101,0.001707876,0.00182263,0.00427322,0.005179664,0.002339084,0.01586203],"category_scores_gemma":[0.008548597,0.001030758,0.001741944,0.005537322,0.001407237,0.007759016,0.005091123,0.004621803,0.005076493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004559183,"about_ca_system_score_gemma":0.004165075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007251105,"about_ca_topic_score_gemma":0.009699298,"domain_scores_codex":[0.9964333,0.0006161632,0.0002349193,0.0006628304,0.001385432,0.0006673874],"domain_scores_gemma":[0.99492,0.001703813,0.0002371017,0.002343805,0.0004746691,0.0003207122],"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.003113868,0.0009014157,0.0009513233,0.0005558257,0.0001434346,0.0001584268,0.0004141538,0.158517,0.01667281,0.1045624,0.05376275,0.6602467],"study_design_scores_gemma":[0.0003472225,0.0001500453,0.0003012165,0.00003578278,0.00007550923,0.0001519326,0.00008744933,0.8761163,0.004663044,0.1075068,0.01052176,0.00004284861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02650258,0.001142546,0.9494349,0.001244991,0.000491847,0.0002924906,0.0009138208,0.005916967,0.01405977],"genre_scores_gemma":[0.1967231,0.0006795211,0.7846258,0.0006564776,0.0003285808,0.0005660107,0.002012351,0.000814624,0.01359371],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01586203,"threshold_uncertainty_score":0.05306375,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008633049583876605,"score_gpt":0.228430810156687,"score_spread":0.2197977605728104,"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."}}