Pub Date : 2019-11-30DOI: 10.1007/978-3-030-41672-0_4
J. H. Lutz, Neil Lutz
{"title":"Who Asked Us? How the Theory of Computing Answers Questions about Analysis","authors":"J. H. Lutz, Neil Lutz","doi":"10.1007/978-3-030-41672-0_4","DOIUrl":"https://doi.org/10.1007/978-3-030-41672-0_4","url":null,"abstract":"","PeriodicalId":283980,"journal":{"name":"Complexity and Approximation","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122616060","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1007/978-3-030-41672-0
D. Du, Jie Wang
{"title":"Complexity and Approximation: In Memory of Ker-I Ko","authors":"D. Du, Jie Wang","doi":"10.1007/978-3-030-41672-0","DOIUrl":"https://doi.org/10.1007/978-3-030-41672-0","url":null,"abstract":"","PeriodicalId":283980,"journal":{"name":"Complexity and Approximation","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125283908","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1007/978-3-030-41672-0_15
Chi-Yeh Chen, S. Hsieh
{"title":"An Efficient Approximation Algorithm for the Steiner Tree Problem","authors":"Chi-Yeh Chen, S. Hsieh","doi":"10.1007/978-3-030-41672-0_15","DOIUrl":"https://doi.org/10.1007/978-3-030-41672-0_15","url":null,"abstract":"","PeriodicalId":283980,"journal":{"name":"Complexity and Approximation","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123706891","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1007/978-3-030-41672-0_9
Xiaoming Sun, Yuan Sun, Jialin Zhang
{"title":"Better Upper Bounds for Searching on a Line with Byzantine Robots","authors":"Xiaoming Sun, Yuan Sun, Jialin Zhang","doi":"10.1007/978-3-030-41672-0_9","DOIUrl":"https://doi.org/10.1007/978-3-030-41672-0_9","url":null,"abstract":"","PeriodicalId":283980,"journal":{"name":"Complexity and Approximation","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127775202","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1007/978-3-030-41672-0_14
Erfang Shan, Jilei Shi, W. Lv
{"title":"A Note on the Position Value for Hypergraph Communication Situations","authors":"Erfang Shan, Jilei Shi, W. Lv","doi":"10.1007/978-3-030-41672-0_14","DOIUrl":"https://doi.org/10.1007/978-3-030-41672-0_14","url":null,"abstract":"","PeriodicalId":283980,"journal":{"name":"Complexity and Approximation","volume":"40 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120849734","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：