首次拟合递减装箱算法的紧界为FFD(I) <= 11/9OPT(I) + 6/9

{"title":"首次拟合递减装箱算法的紧界为FFD(I) <= 11/9OPT(I) + 6/9","authors":"G. Dósa","doi":"10.1007/978-3-540-74450-4_1","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":396841,"journal":{"name":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","volume":"135 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"188","resultStr":"{\"title\":\"The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) <= 11/9OPT(I) + 6/9\",\"authors\":\"G. Dósa\",\"doi\":\"10.1007/978-3-540-74450-4_1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":396841,\"journal\":{\"name\":\"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies\",\"volume\":\"135 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-04-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"188\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-540-74450-4_1\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Combinatorics, Algorithms, Probabilistic and Experimental Methodologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-540-74450-4_1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}