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

Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms最新文献

筛选
英文 中文
Faster Algorithm for Turn-based Stochastic Games with Bounded Treewidth 有界树宽的回合随机博弈快速算法
Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms Pub Date : 2023-01-01 DOI: 10.1137/1.9781611977554.ch173
K. Chatterjee, Tobias Meggendorfer, Raimundo Saona, Jakub Svoboda
{"title":"Faster Algorithm for Turn-based Stochastic Games with Bounded Treewidth","authors":"K. Chatterjee, Tobias Meggendorfer, Raimundo Saona, Jakub Svoboda","doi":"10.1137/1.9781611977554.ch173","DOIUrl":"https://doi.org/10.1137/1.9781611977554.ch173","url":null,"abstract":"","PeriodicalId":92709,"journal":{"name":"Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms","volume":"1 1","pages":"4590-4605"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86866502","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
Online and Bandit Algorithms Beyond 𝓁p Norms 在线和强盗算法超越𝓁p规范
Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms Pub Date : 2023-01-01 DOI: 10.48550/arXiv.2210.13755
Thomas Kesselheim, M. Molinaro, Sahil Singla
{"title":"Online and Bandit Algorithms Beyond 𝓁p Norms","authors":"Thomas Kesselheim, M. Molinaro, Sahil Singla","doi":"10.48550/arXiv.2210.13755","DOIUrl":"https://doi.org/10.48550/arXiv.2210.13755","url":null,"abstract":"","PeriodicalId":92709,"journal":{"name":"Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms","volume":"29 1","pages":"1566-1593"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82837722","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
Deterministic counting Lovász local lemma beyond linear programming 确定性计数Lovász超越线性规划的局部引理
Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms Pub Date : 2023-01-01 DOI: 10.1137/1.9781611977554.ch130
Kun He, Chunyang Wang, Yitong Yin
{"title":"Deterministic counting Lovász local lemma beyond linear programming","authors":"Kun He, Chunyang Wang, Yitong Yin","doi":"10.1137/1.9781611977554.ch130","DOIUrl":"https://doi.org/10.1137/1.9781611977554.ch130","url":null,"abstract":"","PeriodicalId":92709,"journal":{"name":"Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms","volume":"10 1","pages":"3388-3425"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73020083","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
On the Integrality Gap of MFN Relaxation for the Capacitated Facility Location Problem 有容设施选址问题中最惠国弛豫的完整性缺口
Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms Pub Date : 2023-01-01 DOI: 10.1137/1.9781611977554.ch40
Mong-Jen Kao
{"title":"On the Integrality Gap of MFN Relaxation for the Capacitated Facility Location Problem","authors":"Mong-Jen Kao","doi":"10.1137/1.9781611977554.ch40","DOIUrl":"https://doi.org/10.1137/1.9781611977554.ch40","url":null,"abstract":"","PeriodicalId":92709,"journal":{"name":"Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms","volume":"22 1","pages":"1071-1089"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79734905","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
Parallel Exact Shortest Paths in Almost Linear Work and Square Root Depth 几乎线性工作和平方根深度中的平行精确最短路径
Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms Pub Date : 2023-01-01 DOI: 10.1137/1.9781611977554.ch166
Nairen Cao, Jeremy T. Fineman
{"title":"Parallel Exact Shortest Paths in Almost Linear Work and Square Root Depth","authors":"Nairen Cao, Jeremy T. Fineman","doi":"10.1137/1.9781611977554.ch166","DOIUrl":"https://doi.org/10.1137/1.9781611977554.ch166","url":null,"abstract":"","PeriodicalId":92709,"journal":{"name":"Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms","volume":"20 1","pages":"4354-4372"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78892282","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
The 𝓁p-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines 𝓁p-Subspace小尺寸草图问题及其在支持向量机中的应用
Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms Pub Date : 2023-01-01 DOI: 10.48550/arXiv.2211.07132
Yi Li, Honghao Lin, David P. Woodruff
{"title":"The 𝓁p-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines","authors":"Yi Li, Honghao Lin, David P. Woodruff","doi":"10.48550/arXiv.2211.07132","DOIUrl":"https://doi.org/10.48550/arXiv.2211.07132","url":null,"abstract":"","PeriodicalId":92709,"journal":{"name":"Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms","volume":"1 1","pages":"850-877"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87525765","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
Single-Pass Streaming Algorithms for Correlation Clustering 关联聚类的单通道流算法
Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms Pub Date : 2023-01-01 DOI: 10.1137/1.9781611977554.ch33
Soheil Behnezhad, M. Charikar, Weiyun Ma, Li-Yang Tan
{"title":"Single-Pass Streaming Algorithms for Correlation Clustering","authors":"Soheil Behnezhad, M. Charikar, Weiyun Ma, Li-Yang Tan","doi":"10.1137/1.9781611977554.ch33","DOIUrl":"https://doi.org/10.1137/1.9781611977554.ch33","url":null,"abstract":"","PeriodicalId":92709,"journal":{"name":"Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms","volume":"1 1","pages":"819-849"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87405847","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
Graph Classes with Few Minimal Separators. II. A Dichotomy 具有很少最小分隔符的图类。2二分法
Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms Pub Date : 2023-01-01 DOI: 10.1137/1.9781611977554.ch120
Peter Gartland, D. Lokshtanov
{"title":"Graph Classes with Few Minimal Separators. II. A Dichotomy","authors":"Peter Gartland, D. Lokshtanov","doi":"10.1137/1.9781611977554.ch120","DOIUrl":"https://doi.org/10.1137/1.9781611977554.ch120","url":null,"abstract":"","PeriodicalId":92709,"journal":{"name":"Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms","volume":"112 1","pages":"3098-3178"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86230911","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
Faster Computation of 3-Edge-Connected Components in Digraphs 有向图中3边连通分量的快速计算
Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms Pub Date : 2023-01-01 DOI: 10.1137/1.9781611977554.ch96
L. Georgiadis, Evangelos Kipouridis, Charis Papadopoulos, Nikos Parotsidis
{"title":"Faster Computation of 3-Edge-Connected Components in Digraphs","authors":"L. Georgiadis, Evangelos Kipouridis, Charis Papadopoulos, Nikos Parotsidis","doi":"10.1137/1.9781611977554.ch96","DOIUrl":"https://doi.org/10.1137/1.9781611977554.ch96","url":null,"abstract":"","PeriodicalId":92709,"journal":{"name":"Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms","volume":"27 1","pages":"2489-2531"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88165836","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
On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions 共轭和左右作用下矩阵元组的轨道闭合交问题
Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms Pub Date : 2023-01-01 DOI: 10.1137/1.9781611977554.ch158
G. Ivanyos, Youming Qiao
{"title":"On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions","authors":"G. Ivanyos, Youming Qiao","doi":"10.1137/1.9781611977554.ch158","DOIUrl":"https://doi.org/10.1137/1.9781611977554.ch158","url":null,"abstract":"","PeriodicalId":92709,"journal":{"name":"Proceedings of the ... Annual ACM-SIAM Symposium on Discrete Algorithms. ACM-SIAM Symposium on Discrete Algorithms","volume":"77 1","pages":"4115-4126"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89423278","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
首页 上一页 下一页 尾页
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学术官方微信
小红书