{"id":"W1517042457","doi":"10.1007/978-3-540-68891-4_13","title":"A Polynomial Time Approximation Scheme for the Square Packing Problem","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Square (algebra); Bin packing problem; Polynomial-time approximation scheme; Combinatorics; Approximation algorithm; Packing problems; Bin; Mathematical optimization; Time complexity; Scheme (mathematics); Discrete mathematics; Algorithm; Mathematical analysis; Geometry","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.0009594553,0.001575047,0.001947146,0.001111642,0.001295639,0.002976853,0.003713461,0.001637287,0.01483471],"category_scores_gemma":[0.004436465,0.0009325058,0.001780062,0.004357569,0.001127476,0.005713005,0.003520533,0.003885049,0.004802673],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002663796,"about_ca_system_score_gemma":0.002187217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004422678,"about_ca_topic_score_gemma":0.004791461,"domain_scores_codex":[0.9984744,0.000205215,0.00008287127,0.0003011688,0.0006526199,0.000283689],"domain_scores_gemma":[0.9982752,0.0007007777,0.00008678425,0.0006617872,0.0001729467,0.0001025976],"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.001232567,0.0005149352,0.0004389385,0.000554817,0.00008310942,0.0001541178,0.0003284929,0.1311245,0.01626703,0.1767559,0.05140289,0.6211427],"study_design_scores_gemma":[0.0004141475,0.0002024268,0.0003294257,0.00005993598,0.00008341715,0.0002928088,0.0001126172,0.7389675,0.006598585,0.2274009,0.02548641,0.00005173338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02282026,0.0009797757,0.9471743,0.000670338,0.0003417123,0.0002955092,0.0006798656,0.003659054,0.0233792],"genre_scores_gemma":[0.1455252,0.0009567265,0.8317383,0.0003406838,0.000266702,0.0004250339,0.001884906,0.0006299046,0.0182326],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01483471,"threshold_uncertainty_score":0.04962701,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0155292284007949,"score_gpt":0.2150886482293441,"score_spread":0.1995594198285492,"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."}}