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

International Conference on Combinatorial Optimization and Applications最新文献

筛选
英文 中文
Highway Preferential Attachment Models for Geographic Routing 用于地理选线的公路优先附着模型
International Conference on Combinatorial Optimization and Applications Pub Date : 2024-03-12 DOI: 10.1007/978-3-031-49614-1_4
Ofek Gila, Evrim Ozel, Michael T. Goodrich
{"title":"Highway Preferential Attachment Models for Geographic Routing","authors":"Ofek Gila, Evrim Ozel, Michael T. Goodrich","doi":"10.1007/978-3-031-49614-1_4","DOIUrl":"https://doi.org/10.1007/978-3-031-49614-1_4","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"40 3","pages":"56-80"},"PeriodicalIF":0.0,"publicationDate":"2024-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140250873","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
Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs 二部图和弦图的连通幂支配的硬度结果
International Conference on Combinatorial Optimization and Applications Pub Date : 2023-06-28 DOI: 10.1007/978-3-030-92681-6_51
Pooja Goyal, B. S. Panda
{"title":"Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs","authors":"Pooja Goyal, B. S. Panda","doi":"10.1007/978-3-030-92681-6_51","DOIUrl":"https://doi.org/10.1007/978-3-030-92681-6_51","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124599676","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
An Improved Approximation Algorithm for Capacitated Correlation Clustering Problem 一种改进的有能力相关聚类问题逼近算法
International Conference on Combinatorial Optimization and Applications Pub Date : 2023-04-27 DOI: 10.1007/978-3-030-92681-6_4
S. Ji, Yukun Cheng, J. Tan, Zhong-ming Zhao
{"title":"An Improved Approximation Algorithm for Capacitated Correlation Clustering Problem","authors":"S. Ji, Yukun Cheng, J. Tan, Zhong-ming Zhao","doi":"10.1007/978-3-030-92681-6_4","DOIUrl":"https://doi.org/10.1007/978-3-030-92681-6_4","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134488161","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
Routing Among Convex Polygonal Obstacles in the Plane 平面上凸多边形障碍物之间的路由
International Conference on Combinatorial Optimization and Applications Pub Date : 2023-04-21 DOI: 10.1007/978-3-030-92681-6_1
R. Inkulu, Pawan Kumar
{"title":"Routing Among Convex Polygonal Obstacles in the Plane","authors":"R. Inkulu, Pawan Kumar","doi":"10.1007/978-3-030-92681-6_1","DOIUrl":"https://doi.org/10.1007/978-3-030-92681-6_1","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114169973","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
Parameterized Complexity of Satisfactory Partition Problem 满意划分问题的参数化复杂度
International Conference on Combinatorial Optimization and Applications Pub Date : 2022-01-01 DOI: 10.1007/978-3-030-64843-5_6
Ajinkya Gaikwad, S. Maity, Shuvam Kant Tripathi
{"title":"Parameterized Complexity of Satisfactory Partition Problem","authors":"Ajinkya Gaikwad, S. Maity, Shuvam Kant Tripathi","doi":"10.1007/978-3-030-64843-5_6","DOIUrl":"https://doi.org/10.1007/978-3-030-64843-5_6","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121435600","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
Finding All Leftmost Separators of Size ≤k 求大小≤k的所有最左分隔符
International Conference on Combinatorial Optimization and Applications Pub Date : 2021-11-04 DOI: 10.1007/978-3-030-92681-6_23
Mahdi Belbasi, Martin Fürer
{"title":"Finding All Leftmost Separators of Size ≤k","authors":"Mahdi Belbasi, Martin Fürer","doi":"10.1007/978-3-030-92681-6_23","DOIUrl":"https://doi.org/10.1007/978-3-030-92681-6_23","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126877572","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 Structural Parameterizations of the Offensive Alliance Problem 进攻性联盟问题的结构参数化研究
International Conference on Combinatorial Optimization and Applications Pub Date : 2021-10-29 DOI: 10.1007/978-3-030-92681-6_45
Ajinkya Gaikwad, S. Maity
{"title":"On Structural Parameterizations of the Offensive Alliance Problem","authors":"Ajinkya Gaikwad, S. Maity","doi":"10.1007/978-3-030-92681-6_45","DOIUrl":"https://doi.org/10.1007/978-3-030-92681-6_45","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128241192","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
Evolutionary Equilibrium Analysis for Decision on Block Size in Blockchain Systems 区块链系统中区块大小决策的演化均衡分析
International Conference on Combinatorial Optimization and Applications Pub Date : 2021-10-19 DOI: 10.1007/978-3-030-92681-6_15
Jinmian Chen, Yukun Cheng, Zhiqi Xu, Yan Cao
{"title":"Evolutionary Equilibrium Analysis for Decision on Block Size in Blockchain Systems","authors":"Jinmian Chen, Yukun Cheng, Zhiqi Xu, Yan Cao","doi":"10.1007/978-3-030-92681-6_15","DOIUrl":"https://doi.org/10.1007/978-3-030-92681-6_15","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131344496","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 Fractional k-truncated Metric Dimension of Graphs 图的分数阶k截断度量维数
International Conference on Combinatorial Optimization and Applications Pub Date : 2021-08-05 DOI: 10.1007/978-3-030-92681-6_44
Eunjeong Yi
{"title":"The Fractional k-truncated Metric Dimension of Graphs","authors":"Eunjeong Yi","doi":"10.1007/978-3-030-92681-6_44","DOIUrl":"https://doi.org/10.1007/978-3-030-92681-6_44","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115626991","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 Complexity of Minimum Maximal Uniquely Restricted Matching 最小最大唯一限制匹配的复杂度
International Conference on Combinatorial Optimization and Applications Pub Date : 2021-08-01 DOI: 10.1007/978-3-030-64843-5_25
Juhi Chaudhary, B. S. Panda
{"title":"On the Complexity of Minimum Maximal Uniquely Restricted Matching","authors":"Juhi Chaudhary, B. S. Panda","doi":"10.1007/978-3-030-64843-5_25","DOIUrl":"https://doi.org/10.1007/978-3-030-64843-5_25","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130416277","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
下一页 尾页
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学术官方微信