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

International Workshop on Combinatorial Algorithms最新文献

筛选
英文 中文
Zero-Suppression and Computation Models 零抑制和计算模型
International Workshop on Combinatorial Algorithms Pub Date : 2018-07-16 DOI: 10.1007/978-3-319-94667-2_22
Hiroki Morizumi
{"title":"Zero-Suppression and Computation Models","authors":"Hiroki Morizumi","doi":"10.1007/978-3-319-94667-2_22","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_22","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116332378","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}
引用次数: 0
Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem 对称旅行商问题的分支定界算法
International Workshop on Combinatorial Algorithms Pub Date : 2018-07-16 DOI: 10.1007/978-3-319-94667-2_26
Alexey Nikolaev, M. Batsyn
{"title":"Branch-and-Bound Algorithm for Symmetric Travelling Salesman Problem","authors":"Alexey Nikolaev, M. Batsyn","doi":"10.1007/978-3-319-94667-2_26","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_26","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114904710","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}
引用次数: 1
LZ-ABT: A Practical Algorithm for α-Balanced Grammar Compression LZ-ABT:一种实用的α-平衡语法压缩算法
International Workshop on Combinatorial Algorithms Pub Date : 2018-07-16 DOI: 10.1007/978-3-319-94667-2_27
Tatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, I. Tomohiro, H. Sakamoto
{"title":"LZ-ABT: A Practical Algorithm for α-Balanced Grammar Compression","authors":"Tatsuya Ohno, Keisuke Goto, Yoshimasa Takabatake, I. Tomohiro, H. Sakamoto","doi":"10.1007/978-3-319-94667-2_27","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_27","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125156029","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
Minsum k-Sink Problem on Dynamic Flow Path Networks 动态流路径网络的最小k-Sink问题
International Workshop on Combinatorial Algorithms Pub Date : 2018-07-16 DOI: 10.1007/978-3-319-94667-2_7
R. Benkoczi, B. Bhattacharya, Yuya Higashikawa, T. Kameda, N. Katoh
{"title":"Minsum k-Sink Problem on Dynamic Flow Path Networks","authors":"R. Benkoczi, B. Bhattacharya, Yuya Higashikawa, T. Kameda, N. Katoh","doi":"10.1007/978-3-319-94667-2_7","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_7","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122710533","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
How Far From a Worst Solution a Random Solution of a kCSP Instance Can Be? 一个kCSP实例的随机解离最坏解有多远?
International Workshop on Combinatorial Algorithms Pub Date : 2018-07-16 DOI: 10.1007/978-3-319-94667-2_31
Jean-François Culus, S. Toulouse
{"title":"How Far From a Worst Solution a Random Solution of a kCSP Instance Can Be?","authors":"Jean-François Culus, S. Toulouse","doi":"10.1007/978-3-319-94667-2_31","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_31","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129929319","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
On the Parameterized Complexity of Colorful Components and Related Problems 彩色构件参数化复杂性及相关问题研究
International Workshop on Combinatorial Algorithms Pub Date : 2018-07-16 DOI: 10.1007/978-3-319-94667-2_20
Neeldhara Misra
{"title":"On the Parameterized Complexity of Colorful Components and Related Problems","authors":"Neeldhara Misra","doi":"10.1007/978-3-319-94667-2_20","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_20","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132937507","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
Analysis of Information Leakage Due to Operative Errors in Card-Based Protocols 基于卡的协议操作错误导致的信息泄露分析
International Workshop on Combinatorial Algorithms Pub Date : 2018-07-16 DOI: 10.1007/978-3-319-94667-2_21
T. Mizuki, Y. Komano
{"title":"Analysis of Information Leakage Due to Operative Errors in Card-Based Protocols","authors":"T. Mizuki, Y. Komano","doi":"10.1007/978-3-319-94667-2_21","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_21","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125521885","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
Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families 使用嵌套无覆盖族的高效无界容错聚合签名
International Workshop on Combinatorial Algorithms Pub Date : 2018-07-16 DOI: 10.1007/978-3-319-94667-2_5
Thaís Bardini Idalino, Lucia Moura
{"title":"Efficient Unbounded Fault-Tolerant Aggregate Signatures Using Nested Cover-Free Families","authors":"Thaís Bardini Idalino, Lucia Moura","doi":"10.1007/978-3-319-94667-2_5","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_5","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129738294","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
Placing Segments on Parallel Arcs 在平行弧线上放置分段
International Workshop on Combinatorial Algorithms Pub Date : 2018-07-16 DOI: 10.1007/978-3-319-94667-2_25
Yen Kaow Ng, Wenlong Jia, S. Li
{"title":"Placing Segments on Parallel Arcs","authors":"Yen Kaow Ng, Wenlong Jia, S. Li","doi":"10.1007/978-3-319-94667-2_25","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_25","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"898 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117059125","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}
引用次数: 0
Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract) 非成对相容图:一种新的证明技术(扩展摘要)
International Workshop on Combinatorial Algorithms Pub Date : 2018-07-16 DOI: 10.1007/978-3-319-94667-2_4
P. Baiocchi, T. Calamoneri, A. Monti, R. Petreschi
{"title":"Graphs that Are Not Pairwise Compatible: A New Proof Technique (Extended Abstract)","authors":"P. Baiocchi, T. Calamoneri, A. Monti, R. Petreschi","doi":"10.1007/978-3-319-94667-2_4","DOIUrl":"https://doi.org/10.1007/978-3-319-94667-2_4","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"2000 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123547090","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
首页 上一页 下一页 尾页
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学术官方微信