{"title":"度量空间中最优半径增广树的算法","authors":"Joachim Gudmundsson, Y. Sha","doi":"10.1007/978-3-030-83508-8_33","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"32 1","pages":"102018"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Algorithms for Radius-Optimally Augmenting Trees in a Metric Space\",\"authors\":\"Joachim Gudmundsson, Y. Sha\",\"doi\":\"10.1007/978-3-030-83508-8_33\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":11245,\"journal\":{\"name\":\"Discret. Comput. Geom.\",\"volume\":\"32 1\",\"pages\":\"102018\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discret. Comput. Geom.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-83508-8_33\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discret. Comput. Geom.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-83508-8_33","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}