带数据集发布时间的数据采集网络的最大跨度最小化

{"title":"带数据集发布时间的数据采集网络的最大跨度最小化","authors":"J. Berlińska","doi":"10.1007/978-3-030-43222-5_20","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":431607,"journal":{"name":"Parallel Processing and Applied Mathematics","volume":"130 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Makespan Minimization in Data Gathering Networks with Dataset Release Times\",\"authors\":\"J. Berlińska\",\"doi\":\"10.1007/978-3-030-43222-5_20\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":431607,\"journal\":{\"name\":\"Parallel Processing and Applied Mathematics\",\"volume\":\"130 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Parallel Processing and Applied Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-43222-5_20\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Parallel Processing and Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-43222-5_20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}