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

Scandinavian Workshop on Algorithm Theory最新文献

筛选
英文 中文
Polynomial Kernels for Hard Problems on Disk Graphs 磁盘图上难问题的多项式核
Scandinavian Workshop on Algorithm Theory Pub Date : 2010-06-21 DOI: 10.1007/978-3-642-13731-0_30
B. Jansen
{"title":"Polynomial Kernels for Hard Problems on Disk Graphs","authors":"B. Jansen","doi":"10.1007/978-3-642-13731-0_30","DOIUrl":"https://doi.org/10.1007/978-3-642-13731-0_30","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"26 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":"127938662","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}
引用次数: 10
Online Function Tracking with Generalized Penalties 具有广义惩罚的在线函数跟踪
Scandinavian Workshop on Algorithm Theory Pub Date : 2010-06-21 DOI: 10.1007/978-3-642-13731-0_34
Marcin Bienkowski, S. Schmid
{"title":"Online Function Tracking with Generalized Penalties","authors":"Marcin Bienkowski, S. Schmid","doi":"10.1007/978-3-642-13731-0_34","DOIUrl":"https://doi.org/10.1007/978-3-642-13731-0_34","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"25 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":"121457190","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}
引用次数: 7
Minimizing the Diameter of a Network Using Shortcut Edges 使用快捷边最小化网络的直径
Scandinavian Workshop on Algorithm Theory Pub Date : 2010-06-21 DOI: 10.1007/978-3-642-13731-0_39
E. Demaine, Morteza Zadimoghaddam
{"title":"Minimizing the Diameter of a Network Using Shortcut Edges","authors":"E. Demaine, Morteza Zadimoghaddam","doi":"10.1007/978-3-642-13731-0_39","DOIUrl":"https://doi.org/10.1007/978-3-642-13731-0_39","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"6 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":"127755211","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}
引用次数: 99
Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput 将等长作业分派到并行机器以最大化吞吐量
Scandinavian Workshop on Algorithm Theory Pub Date : 2010-06-21 DOI: 10.1007/978-3-642-13731-0_33
David P. Bunde, Michael H. Goldwasser
{"title":"Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput","authors":"David P. Bunde, Michael H. Goldwasser","doi":"10.1007/978-3-642-13731-0_33","DOIUrl":"https://doi.org/10.1007/978-3-642-13731-0_33","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":"129349244","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}
引用次数: 4
Strictly-Regular Number System and Data Structures 严格正则数系统与数据结构
Scandinavian Workshop on Algorithm Theory Pub Date : 2010-06-21 DOI: 10.1007/978-3-642-13731-0_4
Amr Elmasry, Claus Jensen, J. Katajainen
{"title":"Strictly-Regular Number System and Data Structures","authors":"Amr Elmasry, Claus Jensen, J. Katajainen","doi":"10.1007/978-3-642-13731-0_4","DOIUrl":"https://doi.org/10.1007/978-3-642-13731-0_4","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":"124912768","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}
引用次数: 8
Improved Methods For Generating Quasi-Gray Codes 准灰度码生成的改进方法
Scandinavian Workshop on Algorithm Theory Pub Date : 2010-06-21 DOI: 10.1007/978-3-642-13731-0_22
D. Jansens, P. Bose, Paz Carmi, A. Maheshwari, Pat Morin, M. Smid
{"title":"Improved Methods For Generating Quasi-Gray Codes","authors":"D. Jansens, P. Bose, Paz Carmi, A. Maheshwari, Pat Morin, M. Smid","doi":"10.1007/978-3-642-13731-0_22","DOIUrl":"https://doi.org/10.1007/978-3-642-13731-0_22","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"3 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":"131347918","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}
引用次数: 12
Approximating the Maximum 3- and 4-Edge-Colorable Subgraph 逼近最大3边和4边可着色子图
Scandinavian Workshop on Algorithm Theory Pub Date : 2010-06-21 DOI: 10.1007/978-3-642-13731-0_37
M. Kaminski, Lukasz Kowalik
{"title":"Approximating the Maximum 3- and 4-Edge-Colorable Subgraph","authors":"M. Kaminski, Lukasz Kowalik","doi":"10.1007/978-3-642-13731-0_37","DOIUrl":"https://doi.org/10.1007/978-3-642-13731-0_37","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"74 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":"114841764","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}
引用次数: 3
Capacitated Domination Faster Than O(2n) 能力支配比0 (2n)更快
Scandinavian Workshop on Algorithm Theory Pub Date : 2010-06-21 DOI: 10.1007/978-3-642-13731-0_8
Marek Cygan, Marcin Pilipczuk, J. O. Wojtaszczyk
{"title":"Capacitated Domination Faster Than O(2n)","authors":"Marek Cygan, Marcin Pilipczuk, J. O. Wojtaszczyk","doi":"10.1007/978-3-642-13731-0_8","DOIUrl":"https://doi.org/10.1007/978-3-642-13731-0_8","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"105 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":"121505728","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}
引用次数: 28
Minimum and maximum against k lies k的最小值和最大值
Scandinavian Workshop on Algorithm Theory Pub Date : 2010-02-02 DOI: 10.1007/978-3-642-13731-0_14
M. Hoffmann, J. Matoušek, Y. Okamoto, P. Zumstein
{"title":"Minimum and maximum against k lies","authors":"M. Hoffmann, J. Matoušek, Y. Okamoto, P. Zumstein","doi":"10.1007/978-3-642-13731-0_14","DOIUrl":"https://doi.org/10.1007/978-3-642-13731-0_14","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128210299","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}
引用次数: 3
Improved Algorithm for Degree Bounded Survivable Network Design Problem 度有界可生存网络设计问题的改进算法
Scandinavian Workshop on Algorithm Theory Pub Date : 2009-11-23 DOI: 10.1007/978-3-642-13731-0_38
Anand Louis, Nisheeth K. Vishnoi
{"title":"Improved Algorithm for Degree Bounded Survivable Network Design Problem","authors":"Anand Louis, Nisheeth K. Vishnoi","doi":"10.1007/978-3-642-13731-0_38","DOIUrl":"https://doi.org/10.1007/978-3-642-13731-0_38","url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131130188","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}
引用次数: 16
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信