小k的最大k子数组:分治法变得更简单

{"title":"小k的最大k子数组:分治法变得更简单","authors":"Hemant Malik, O. Daescu","doi":"10.1007/978-3-030-34029-2_29","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":186261,"journal":{"name":"Analysis of Experimental Algorithms - Special Event","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"k-Maximum Subarrays for Small k: Divide-and-Conquer made simpler\",\"authors\":\"Hemant Malik, O. Daescu\",\"doi\":\"10.1007/978-3-030-34029-2_29\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":186261,\"journal\":{\"name\":\"Analysis of Experimental Algorithms - Special Event\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-04-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Analysis of Experimental Algorithms - Special Event\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-34029-2_29\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Analysis of Experimental Algorithms - Special Event","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-34029-2_29","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}