发布求助
文献互助 智能选刊 最新文献

Scandinavian Workshop on Algorithm Theory最新文献

筛选
英文 中文
Annotating Simplices with a Homology Basis and Its Applications 用同调基标注简单子及其应用
Scandinavian Workshop on Algorithm Theory Pub Date : 2011-07-19 DOI: 10.1007/978-3-642-31155-0_17
Oleksiy Busaryev, Sergio Cabello, Chao Chen, T. Dey, Yusu Wang
{"title":"Annotating Simplices with a Homology Basis and Its Applications","authors":"Oleksiy Busaryev, Sergio Cabello, Chao Chen, T. Dey, Yusu Wang","doi":"10.1007/978-3-642-31155-0_17","DOIUrl":"https://doi.org/10.1007/978-3-642-31155-0_17","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121152113","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}
引用次数: 50
A Bottom-Up Method and Fast Algorithms for max independent set 最大独立集的一种自底向上方法及快速算法
Scandinavian Workshop on Algorithm Theory Pub Date : 2010-06-21 DOI: 10.1007/978-3-642-13731-0_7
N. Bourgeois, B. Escoffier, V. Paschos, Johan M. M. van Rooij
{"title":"A Bottom-Up Method and Fast Algorithms for max independent set","authors":"N. Bourgeois, B. Escoffier, V. Paschos, Johan M. M. van Rooij","doi":"10.1007/978-3-642-13731-0_7","DOIUrl":"https://doi.org/10.1007/978-3-642-13731-0_7","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116634215","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}
引用次数: 32
Bregman Clustering for Separable Instances 可分离实例的Bregman聚类
Scandinavian Workshop on Algorithm Theory Pub Date : 2010-06-21 DOI: 10.1007/978-3-642-13731-0_21
Marcel R. Ackermann, Johannes Blömer
{"title":"Bregman Clustering for Separable Instances","authors":"Marcel R. Ackermann, Johannes Blömer","doi":"10.1007/978-3-642-13731-0_21","DOIUrl":"https://doi.org/10.1007/978-3-642-13731-0_21","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"307 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123198107","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}
引用次数: 22
A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem 多车场多旅行商问题的3/2逼近算法
Scandinavian Workshop on Algorithm Theory Pub Date : 2010-06-21 DOI: 10.1007/978-3-642-13731-0_13
Zhou Xu, B. Rodrigues
{"title":"A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem","authors":"Zhou Xu, B. Rodrigues","doi":"10.1007/978-3-642-13731-0_13","DOIUrl":"https://doi.org/10.1007/978-3-642-13731-0_13","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123813633","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}
引用次数: 18
Feasible and Accurate Algorithms for Covering Semidefinite Programs 覆盖半定规划的可行和精确算法
Scandinavian Workshop on Algorithm Theory Pub Date : 2010-06-21 DOI: 10.1007/978-3-642-13731-0_15
G. Iyengar, D. Phillips, C. Stein
{"title":"Feasible and Accurate Algorithms for Covering Semidefinite Programs","authors":"G. Iyengar, D. Phillips, C. Stein","doi":"10.1007/978-3-642-13731-0_15","DOIUrl":"https://doi.org/10.1007/978-3-642-13731-0_15","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130396797","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}
引用次数: 11
Phase Transitions in Sampling Algorithms and the Underlying Random Structures 采样算法中的相变和底层随机结构
Scandinavian Workshop on Algorithm Theory Pub Date : 2010-06-21 DOI: 10.1007/978-3-642-13731-0_29
Dana Randall
{"title":"Phase Transitions in Sampling Algorithms and the Underlying Random Structures","authors":"Dana Randall","doi":"10.1007/978-3-642-13731-0_29","DOIUrl":"https://doi.org/10.1007/978-3-642-13731-0_29","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130516622","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}
引用次数: 2
Isomorphism for Graphs of Bounded Feedback Vertex Set Number 有界反馈顶点集数图的同构性
Scandinavian Workshop on Algorithm Theory Pub Date : 2010-06-21 DOI: 10.1007/978-3-642-13731-0_9
Stefan Kratsch, Pascal Schweitzer
{"title":"Isomorphism for Graphs of Bounded Feedback Vertex Set Number","authors":"Stefan Kratsch, Pascal Schweitzer","doi":"10.1007/978-3-642-13731-0_9","DOIUrl":"https://doi.org/10.1007/978-3-642-13731-0_9","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131895129","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}
引用次数: 31
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing 共色数与不相交矩形刺入的定参数算法
Scandinavian Workshop on Algorithm Theory Pub Date : 2010-06-21 DOI: 10.1007/978-3-642-13731-0_32
P. Heggernes, D. Kratsch, D. Lokshtanov, Venkatesh Raman, Saket Saurabh
{"title":"Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing","authors":"P. Heggernes, D. Kratsch, D. Lokshtanov, Venkatesh Raman, Saket Saurabh","doi":"10.1007/978-3-642-13731-0_32","DOIUrl":"https://doi.org/10.1007/978-3-642-13731-0_32","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117084097","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}
引用次数: 9
Path Schematization for Route Sketches 路线草图的路径示意图
Scandinavian Workshop on Algorithm Theory Pub Date : 2010-06-21 DOI: 10.1007/978-3-642-13731-0_27
D. Delling, Andreas Gemsa, M. Nöllenburg, Thomas Pajor
{"title":"Path Schematization for Route Sketches","authors":"D. Delling, Andreas Gemsa, M. Nöllenburg, Thomas Pajor","doi":"10.1007/978-3-642-13731-0_27","DOIUrl":"https://doi.org/10.1007/978-3-642-13731-0_27","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123531360","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}
引用次数: 23
Reconstructing a Simple Polygon from Its Angles 从其角度重建一个简单多边形
Scandinavian Workshop on Algorithm Theory Pub Date : 2010-06-21 DOI: 10.1007/978-3-642-13731-0_2
Y. Disser, Matús Mihalák, P. Widmayer
{"title":"Reconstructing a Simple Polygon from Its Angles","authors":"Y. Disser, Matús Mihalák, P. Widmayer","doi":"10.1007/978-3-642-13731-0_2","DOIUrl":"https://doi.org/10.1007/978-3-642-13731-0_2","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129152091","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}
引用次数: 9
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信