树上最大供给率问题的一种强多项式时间算法

{"title":"树上最大供给率问题的一种强多项式时间算法","authors":"Koki Takayama, Yusuke Kobayashi","doi":"10.1007/978-3-319-78455-7_5","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees\",\"authors\":\"Koki Takayama, Yusuke Kobayashi\",\"doi\":\"10.1007/978-3-319-78455-7_5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":101589,\"journal\":{\"name\":\"Frontiers in Algorithmics\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-05-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Frontiers in Algorithmics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-78455-7_5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Frontiers in Algorithmics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-78455-7_5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}