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

International Workshop on Combinatorial Algorithms最新文献

筛选
英文 中文
Lower bounds on the performance of online algorithms for relaxed packing problems 松弛包装问题在线算法性能的下界
International Workshop on Combinatorial Algorithms Pub Date : 2022-01-16 DOI: 10.1007/978-3-031-06678-8_8
J. Balogh, Gyorgy D'osa, L. Epstein, Lukasz Je.z
{"title":"Lower bounds on the performance of online algorithms for relaxed packing problems","authors":"J. Balogh, Gyorgy D'osa, L. Epstein, Lukasz Je.z","doi":"10.1007/978-3-031-06678-8_8","DOIUrl":"https://doi.org/10.1007/978-3-031-06678-8_8","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122064106","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
The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs 2正则图上的开槽在线单侧交叉最小化问题
International Workshop on Combinatorial Algorithms Pub Date : 2022-01-11 DOI: 10.1007/978-3-031-06678-8_18
E. Burjons, Janosch Fuchs, Henri Lotze
{"title":"The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs","authors":"E. Burjons, Janosch Fuchs, Henri Lotze","doi":"10.1007/978-3-031-06678-8_18","DOIUrl":"https://doi.org/10.1007/978-3-031-06678-8_18","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116168848","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
An Additive Approximation Scheme for the Nash Social Welfare Maximization with Identical Additive Valuations 具有相同可加值的纳什社会福利最大化的可加逼近格式
International Workshop on Combinatorial Algorithms Pub Date : 2022-01-05 DOI: 10.1007/978-3-031-06678-8_25
Asei Inoue, Yusuke Kobayashi
{"title":"An Additive Approximation Scheme for the Nash Social Welfare Maximization with Identical Additive Valuations","authors":"Asei Inoue, Yusuke Kobayashi","doi":"10.1007/978-3-031-06678-8_25","DOIUrl":"https://doi.org/10.1007/978-3-031-06678-8_25","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133022836","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
Harmless Sets in Sparse Classes 稀疏类中的无害集
International Workshop on Combinatorial Algorithms Pub Date : 2021-11-23 DOI: 10.1007/978-3-031-06678-8_22
Paal Gronaas Drange, I. Muzi, F. Reidl
{"title":"Harmless Sets in Sparse Classes","authors":"Paal Gronaas Drange, I. Muzi, F. Reidl","doi":"10.1007/978-3-031-06678-8_22","DOIUrl":"https://doi.org/10.1007/978-3-031-06678-8_22","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134155987","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
Partial-Adaptive Submodular Maximization 部分自适应子模最大化
International Workshop on Combinatorial Algorithms Pub Date : 2021-11-01 DOI: 10.1007/978-3-031-34347-6_32
Shaojie Tang, Jing Yuan
{"title":"Partial-Adaptive Submodular Maximization","authors":"Shaojie Tang, Jing Yuan","doi":"10.1007/978-3-031-34347-6_32","DOIUrl":"https://doi.org/10.1007/978-3-031-34347-6_32","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124883225","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
Isomorphic unordered labeled trees up to substitution ciphering 同构无序标记树直到替换密码
International Workshop on Combinatorial Algorithms Pub Date : 2021-05-12 DOI: 10.1007/978-3-030-79987-8_27
Florian Ingels, Romain Azais
{"title":"Isomorphic unordered labeled trees up to substitution ciphering","authors":"Florian Ingels, Romain Azais","doi":"10.1007/978-3-030-79987-8_27","DOIUrl":"https://doi.org/10.1007/978-3-030-79987-8_27","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122014355","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
A Hamilton Cycle in the k-Sided Pancake Network k面煎饼网络中的Hamilton循环
International Workshop on Combinatorial Algorithms Pub Date : 2021-03-16 DOI: 10.1007/978-3-030-79987-8_10
B. Cameron, J. Sawada, A. Williams
{"title":"A Hamilton Cycle in the k-Sided Pancake Network","authors":"B. Cameron, J. Sawada, A. Williams","doi":"10.1007/978-3-030-79987-8_10","DOIUrl":"https://doi.org/10.1007/978-3-030-79987-8_10","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129744656","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}
引用次数: 6
Tukey Depth Histograms 深度直方图
International Workshop on Combinatorial Algorithms Pub Date : 2021-03-15 DOI: 10.1007/978-3-031-06678-8_14
Daniel Bertschinger, Jonas Passweg, P. Schnider
{"title":"Tukey Depth Histograms","authors":"Daniel Bertschinger, Jonas Passweg, P. Schnider","doi":"10.1007/978-3-031-06678-8_14","DOIUrl":"https://doi.org/10.1007/978-3-031-06678-8_14","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127179792","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
Approximation algorithms for hitting subgraphs 命中子图的近似算法
International Workshop on Combinatorial Algorithms Pub Date : 2020-11-29 DOI: 10.1007/978-3-030-79987-8_26
Noah Brüstle, T. Elbaz, Hamed Hatami, Onur Kocer, Bingchan Ma
{"title":"Approximation algorithms for hitting subgraphs","authors":"Noah Brüstle, T. Elbaz, Hamed Hatami, Onur Kocer, Bingchan Ma","doi":"10.1007/978-3-030-79987-8_26","DOIUrl":"https://doi.org/10.1007/978-3-030-79987-8_26","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115545348","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
An Efficient Noisy Binary Search in Graphs via Median Approximation 基于中值逼近的图中有效噪声二叉搜索
International Workshop on Combinatorial Algorithms Pub Date : 2020-04-30 DOI: 10.1007/978-3-030-79987-8_19
D. Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uzna'nski
{"title":"An Efficient Noisy Binary Search in Graphs via Median Approximation","authors":"D. Dereniowski, Aleksander Lukasiewicz, Przemyslaw Uzna'nski","doi":"10.1007/978-3-030-79987-8_19","DOIUrl":"https://doi.org/10.1007/978-3-030-79987-8_19","url":null,"abstract":"","PeriodicalId":403593,"journal":{"name":"International Workshop on Combinatorial Algorithms","volume":"315 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134482980","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
首页 上一页 下一页 尾页
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学术官方微信