{"title":"划分和放置问题中的一维模型(仅抽象)","authors":"R. Melnyk","doi":"10.1145/352491.352503","DOIUrl":null,"url":null,"abstract":"The approach for the model partitioning and packaging on the base of the graph linear placement and assignment algorithms is considered. The properties of the constructive and iteration algorithms based on the optimal reduction tree method are described.","PeriodicalId":376536,"journal":{"name":"Symposium on Contemporary Computing in Ukraine","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"One dimension models in the partitioning and placement problems (abstract only)\",\"authors\":\"R. Melnyk\",\"doi\":\"10.1145/352491.352503\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The approach for the model partitioning and packaging on the base of the graph linear placement and assignment algorithms is considered. The properties of the constructive and iteration algorithms based on the optimal reduction tree method are described.\",\"PeriodicalId\":376536,\"journal\":{\"name\":\"Symposium on Contemporary Computing in Ukraine\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Symposium on Contemporary Computing in Ukraine\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/352491.352503\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symposium on Contemporary Computing in Ukraine","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/352491.352503","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
One dimension models in the partitioning and placement problems (abstract only)
The approach for the model partitioning and packaging on the base of the graph linear placement and assignment algorithms is considered. The properties of the constructive and iteration algorithms based on the optimal reduction tree method are described.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
