Pub Date : 2012-07-04DOI: 10.1007/978-3-642-31155-0_5
Mohammad Ali Abam, Zahed Rahmati, Alireza Zarei
{"title":"Kinetic Pie Delaunay Graph and Its Applications","authors":"Mohammad Ali Abam, Zahed Rahmati, Alireza Zarei","doi":"10.1007/978-3-642-31155-0_5","DOIUrl":"https://doi.org/10.1007/978-3-642-31155-0_5","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130652917","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 : 2012-07-04DOI: 10.1007/978-3-642-31155-0_4
A. Dumitrescu, Joseph S. B. Mitchell, P. Żyliński
{"title":"Watchman Routes for Lines and Segments","authors":"A. Dumitrescu, Joseph S. B. Mitchell, P. Żyliński","doi":"10.1007/978-3-642-31155-0_4","DOIUrl":"https://doi.org/10.1007/978-3-642-31155-0_4","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133243570","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 : 2012-07-04DOI: 10.1007/978-3-642-31155-0_2
Jessica Sherette, C. Wenk
{"title":"Partial Matching between Surfaces Using Fréchet Distance","authors":"Jessica Sherette, C. Wenk","doi":"10.1007/978-3-642-31155-0_2","DOIUrl":"https://doi.org/10.1007/978-3-642-31155-0_2","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124076579","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 : 2012-07-04DOI: 10.1007/978-3-642-31155-0_12
Yijie Han, T. Takaoka
{"title":"An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths","authors":"Yijie Han, T. Takaoka","doi":"10.1007/978-3-642-31155-0_12","DOIUrl":"https://doi.org/10.1007/978-3-642-31155-0_12","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"1856 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129891689","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 : 2012-07-04DOI: 10.1007/978-3-642-31155-0_18
Rom Aschner, M. J. Katz, G. Morgenstern
{"title":"Do Directional Antennas Facilitate in Reducing Interferences?","authors":"Rom Aschner, M. J. Katz, G. Morgenstern","doi":"10.1007/978-3-642-31155-0_18","DOIUrl":"https://doi.org/10.1007/978-3-642-31155-0_18","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131952622","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 : 2012-07-04DOI: 10.1007/978-3-642-31155-0_13
A. Atminas, V. Lozin, Igor Razgon
{"title":"Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths","authors":"A. Atminas, V. Lozin, Igor Razgon","doi":"10.1007/978-3-642-31155-0_13","DOIUrl":"https://doi.org/10.1007/978-3-642-31155-0_13","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129131510","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 : 2012-07-04DOI: 10.1007/978-3-642-31155-0_20
M. Bläser, K. Panagiotou, V. B., Raghavendra Rao
{"title":"A Probabilistic Analysis of Christofides' Algorithm","authors":"M. Bläser, K. Panagiotou, V. B., Raghavendra Rao","doi":"10.1007/978-3-642-31155-0_20","DOIUrl":"https://doi.org/10.1007/978-3-642-31155-0_20","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"15 21","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120813761","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 : 2012-04-18DOI: 10.1007/978-3-642-31155-0_29
J. Boyar, Sushmita Gupta, Kim S. Larsen
{"title":"Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis","authors":"J. Boyar, Sushmita Gupta, Kim S. Larsen","doi":"10.1007/978-3-642-31155-0_29","DOIUrl":"https://doi.org/10.1007/978-3-642-31155-0_29","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115598871","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
扫码关注我们
求助内容：
应助结果提醒方式：