在比赛中寻找(近似大小)距离-d支配集的复杂性

{"title":"在比赛中寻找(近似大小)距离-d支配集的复杂性","authors":"A. Biswas, Varunkumar Jayapaul, Venkatesh Raman, S. Rao","doi":"10.1007/978-3-319-59605-1_3","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments\",\"authors\":\"A. Biswas, Varunkumar Jayapaul, Venkatesh Raman, S. Rao\",\"doi\":\"10.1007/978-3-319-59605-1_3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":101589,\"journal\":{\"name\":\"Frontiers in Algorithmics\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Frontiers in Algorithmics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-59605-1_3\",\"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-59605-1_3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}