DEGREE BOUNDED GEOMETRIC SPANNING TREES WITH A BOTTLENECK OBJECTIVE FUNCTIONPatrick John AndersenBulletin of the Australian Mathematical Society（2019）SCI 4区Univ Melbourne被引用0|浏览5摘要An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.更多查看译文关键词minimum spanning trees,bottleneck objective,approximation algorithms,discrete geometry,bounded degree,combinatorial optimisationPDF原文链接分享引用加入学术空间AI Read Science数据免责声明页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果，我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问，可以通过电子邮件方式联系我们：report@aminer.cnAI 解读一键生成论文网页Chat Paper正在生成论文摘要
原文链接
分享
引用
