首页 > 最新文献

Frontiers in Algorithmics最新文献

英文 中文
Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases 在线矩阵-向量猜想的离线推广及其简单情况的辨识
Pub Date : 2019-04-09 DOI: 10.1007/978-3-030-18126-0_14
L. Gąsieniec, J. Jansson, C. Levcopoulos, A. Lingas, Mia Persson
{"title":"Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases","authors":"L. Gąsieniec, J. Jansson, C. Levcopoulos, A. Lingas, Mia Persson","doi":"10.1007/978-3-030-18126-0_14","DOIUrl":"https://doi.org/10.1007/978-3-030-18126-0_14","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127198148","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 FPTAS for Stochastic Unbounded Min-Knapsack Problem 随机无界最小背包问题的FPTAS
Pub Date : 2019-03-01 DOI: 10.1007/978-3-030-18126-0_11
Zhihao Jiang, Haoyu Zhao
{"title":"An FPTAS for Stochastic Unbounded Min-Knapsack Problem","authors":"Zhihao Jiang, Haoyu Zhao","doi":"10.1007/978-3-030-18126-0_11","DOIUrl":"https://doi.org/10.1007/978-3-030-18126-0_11","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125482597","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
Efficient Algorithms for a Graph Partitioning Problem 图划分问题的高效算法
Pub Date : 2018-05-08 DOI: 10.1007/978-3-319-78455-7_3
S. Vaishali, M. Atulya, Nidhi Purohit
{"title":"Efficient Algorithms for a Graph Partitioning Problem","authors":"S. Vaishali, M. Atulya, Nidhi Purohit","doi":"10.1007/978-3-319-78455-7_3","DOIUrl":"https://doi.org/10.1007/978-3-319-78455-7_3","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116294431","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
Low-Weight Superimposed Codes and Their Applications 低重量叠加码及其应用
Pub Date : 2018-05-08 DOI: 10.1007/978-3-319-78455-7_15
L. Gargano, A. A. Rescigno, U. Vaccaro
{"title":"Low-Weight Superimposed Codes and Their Applications","authors":"L. Gargano, A. A. Rescigno, U. Vaccaro","doi":"10.1007/978-3-319-78455-7_15","DOIUrl":"https://doi.org/10.1007/978-3-319-78455-7_15","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123868609","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
A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees 树上最大供给率问题的一种强多项式时间算法
Pub Date : 2018-05-08 DOI: 10.1007/978-3-319-78455-7_5
Koki Takayama, Yusuke Kobayashi
{"title":"A Strongly Polynomial Time Algorithm for the Maximum Supply Rate Problem on Trees","authors":"Koki Takayama, Yusuke Kobayashi","doi":"10.1007/978-3-319-78455-7_5","DOIUrl":"https://doi.org/10.1007/978-3-319-78455-7_5","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114516003","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
Balanced Random Constraint Satisfaction: Phase Transition and Hardness 平衡随机约束满足:相变和硬度
Pub Date : 2018-05-08 DOI: 10.1007/978-3-319-78455-7_18
Tian Liu, Chaoyi Wang, W. Xu
{"title":"Balanced Random Constraint Satisfaction: Phase Transition and Hardness","authors":"Tian Liu, Chaoyi Wang, W. Xu","doi":"10.1007/978-3-319-78455-7_18","DOIUrl":"https://doi.org/10.1007/978-3-319-78455-7_18","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133224123","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
Kernelization for P2-Packing: A Gerrymandering Approach P2-Packing的核化:一个Gerrymandering方法
Pub Date : 2018-05-08 DOI: 10.1007/978-3-319-78455-7_11
Wen J. Li, Junjie Ye, Yixin Cao
{"title":"Kernelization for P2-Packing: A Gerrymandering Approach","authors":"Wen J. Li, Junjie Ye, Yixin Cao","doi":"10.1007/978-3-319-78455-7_11","DOIUrl":"https://doi.org/10.1007/978-3-319-78455-7_11","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132033170","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
Non-orthogonal Homothetic Range Partial-Sum Query on Integer Grids - [Extended Abstract] 整数网格上的非正交同形范围部分和查询-[扩展摘要]
Pub Date : 2018-05-08 DOI: 10.1007/978-3-319-78455-7_21
Yuan Tang, Haibin Kan
{"title":"Non-orthogonal Homothetic Range Partial-Sum Query on Integer Grids - [Extended Abstract]","authors":"Yuan Tang, Haibin Kan","doi":"10.1007/978-3-319-78455-7_21","DOIUrl":"https://doi.org/10.1007/978-3-319-78455-7_21","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"131 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127006693","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
Some (in)tractable Parameterizations of Coloring and List-Coloring 一些可处理的着色和列表着色的参数化
Pub Date : 2018-05-08 DOI: 10.1007/978-3-319-78455-7_10
P. Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman
{"title":"Some (in)tractable Parameterizations of Coloring and List-Coloring","authors":"P. Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman","doi":"10.1007/978-3-319-78455-7_10","DOIUrl":"https://doi.org/10.1007/978-3-319-78455-7_10","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114833142","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
Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints UTVPI约束下线性可行性的最优长度树状反驳
Pub Date : 2018-05-08 DOI: 10.1007/978-3-319-78455-7_23
P. Wojciechowski, K. Subramani, M. Williamson
{"title":"Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints","authors":"P. Wojciechowski, K. Subramani, M. Williamson","doi":"10.1007/978-3-319-78455-7_23","DOIUrl":"https://doi.org/10.1007/978-3-319-78455-7_23","url":null,"abstract":"","PeriodicalId":101589,"journal":{"name":"Frontiers in Algorithmics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116127604","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
期刊
Frontiers in Algorithmics
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1