{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002967116,0.0002821973,0.0002310697,0.0002324033,0.0002311351,0.0001822664,0.0005144439,0.000205829,0.00003313865],"category_scores_gemma":[0.00002799252,0.0002226922,0.00008519211,0.0002045483,0.0002015421,0.0001554581,0.00008769197,0.0003559299,0.00002600701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001384035,"about_ca_system_score_gemma":0.00009273361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002572795,"about_ca_topic_score_gemma":0.000008160205,"domain_scores_codex":[0.9987015,0.000006486836,0.0002792023,0.0003884699,0.0003022485,0.0003220502],"domain_scores_gemma":[0.9991432,0.0002563387,0.0000864638,0.0003558704,0.0001095806,0.00004859201],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003286176,0.000003722821,0.000005734735,0.00008038963,0.00001111401,0.000001330004,0.0007154061,0.8650153,0.00009777507,0.0001180475,0.0007481732,0.1331998],"study_design_scores_gemma":[0.0001838897,0.00002785081,0.00000606607,0.0001938325,0.000006419624,0.00001766953,8.514476e-8,0.9830505,0.0003582397,0.0008721527,0.01499467,0.0002886147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001200908,0.0004561446,0.9941858,0.000236224,0.0005311327,0.0007308549,0.00001032557,0.0002200771,0.003617412],"genre_scores_gemma":[0.04417531,0.0002490967,0.9516403,0.0006995398,0.001507618,0.00009715959,0.00008773236,0.0001867079,0.00135653],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1329111,"threshold_uncertainty_score":0.9081126,"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."}}