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

International Conference on Combinatorial Optimization and Applications最新文献

筛选
英文 中文
Two-Stage Pricing Strategy with Price Discount in Online Social Networks 基于价格折扣的在线社交网络两阶段定价策略
International Conference on Combinatorial Optimization and Applications Pub Date : 2021-06-08 DOI: 10.1007/978-3-030-64843-5_13
He Yuan, Ziwei Liang, Hongwei Du
{"title":"Two-Stage Pricing Strategy with Price Discount in Online Social Networks","authors":"He Yuan, Ziwei Liang, Hongwei Du","doi":"10.1007/978-3-030-64843-5_13","DOIUrl":"https://doi.org/10.1007/978-3-030-64843-5_13","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130234163","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
Star-Critical Ramsey Number of Large Cycle and Book 星临界拉姆齐数的大循环和书
International Conference on Combinatorial Optimization and Applications Pub Date : 2020-12-11 DOI: 10.1007/978-3-030-64843-5_51
Yan Li, Yusheng Li, Ye Wang
{"title":"Star-Critical Ramsey Number of Large Cycle and Book","authors":"Yan Li, Yusheng Li, Ye Wang","doi":"10.1007/978-3-030-64843-5_51","DOIUrl":"https://doi.org/10.1007/978-3-030-64843-5_51","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115641560","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
Parameterized Algorithms for Fixed-Order Book Drawing with Bounded Number of Crossings per Edge 每条边有限定交叉数的定序画册的参数化算法
International Conference on Combinatorial Optimization and Applications Pub Date : 2020-12-11 DOI: 10.1007/978-3-030-64843-5_38
Yunlong Liu, Jie Chen, Jingui Huang
{"title":"Parameterized Algorithms for Fixed-Order Book Drawing with Bounded Number of Crossings per Edge","authors":"Yunlong Liu, Jie Chen, Jingui Huang","doi":"10.1007/978-3-030-64843-5_38","DOIUrl":"https://doi.org/10.1007/978-3-030-64843-5_38","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"305 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131837022","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
Reading Articles Online 在线阅读文章
International Conference on Combinatorial Optimization and Applications Pub Date : 2020-12-08 DOI: 10.1007/978-3-030-64843-5_43
A. Karrenbauer, E. Kovalevskaya
{"title":"Reading Articles Online","authors":"A. Karrenbauer, E. Kovalevskaya","doi":"10.1007/978-3-030-64843-5_43","DOIUrl":"https://doi.org/10.1007/978-3-030-64843-5_43","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132739517","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
Nearly Complete Characterization of 2-Agent Deterministic Strategyproof Mechanisms for Single Facility Location in Lp Space Lp空间中单设施选址的2-Agent确定性防策略机制的几乎完全表征
International Conference on Combinatorial Optimization and Applications Pub Date : 2020-11-26 DOI: 10.1007/978-3-030-64843-5_28
Jianan Lin
{"title":"Nearly Complete Characterization of 2-Agent Deterministic Strategyproof Mechanisms for Single Facility Location in Lp Space","authors":"Jianan Lin","doi":"10.1007/978-3-030-64843-5_28","DOIUrl":"https://doi.org/10.1007/978-3-030-64843-5_28","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114436029","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
Online Maximum k-Interval Coverage Problem 在线最大k-区间覆盖问题
International Conference on Combinatorial Optimization and Applications Pub Date : 2020-11-22 DOI: 10.1007/978-3-030-64843-5_31
Songhua Li, Minming Li, Lingjie Duan, V. Lee
{"title":"Online Maximum k-Interval Coverage Problem","authors":"Songhua Li, Minming Li, Lingjie Duan, V. Lee","doi":"10.1007/978-3-030-64843-5_31","DOIUrl":"https://doi.org/10.1007/978-3-030-64843-5_31","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133560616","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
Price of Fairness in Budget Division for Egalitarian Social Welfare 平等主义社会福利预算分配中的公平价格
International Conference on Combinatorial Optimization and Applications Pub Date : 2020-10-19 DOI: 10.1007/978-3-030-64843-5_40
Zhongzheng Tang, Chenhao Wang, Mengqi Zhang
{"title":"Price of Fairness in Budget Division for Egalitarian Social Welfare","authors":"Zhongzheng Tang, Chenhao Wang, Mengqi Zhang","doi":"10.1007/978-3-030-64843-5_40","DOIUrl":"https://doi.org/10.1007/978-3-030-64843-5_40","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133574097","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
Hardness of Segment Cover, Contiguous SAT and Visibility with Uncertain Obstacles 分段覆盖的硬度、连续SAT和不确定障碍物下的能见度
International Conference on Combinatorial Optimization and Applications Pub Date : 2020-10-19 DOI: 10.1007/978-3-030-64843-5_24
Sharareh Alipour, S. Parsa
{"title":"Hardness of Segment Cover, Contiguous SAT and Visibility with Uncertain Obstacles","authors":"Sharareh Alipour, S. Parsa","doi":"10.1007/978-3-030-64843-5_24","DOIUrl":"https://doi.org/10.1007/978-3-030-64843-5_24","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134590794","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
How to Get a Degree-Anonymous Graph Using Minimum Number of Edge Rotations 如何使用最小的边旋转数获得度匿名图
International Conference on Combinatorial Optimization and Applications Pub Date : 2020-10-06 DOI: 10.1007/978-3-030-64843-5_17
C. Bazgan, Pierre Cazals, J. Chlebíková
{"title":"How to Get a Degree-Anonymous Graph Using Minimum Number of Edge Rotations","authors":"C. Bazgan, Pierre Cazals, J. Chlebíková","doi":"10.1007/978-3-030-64843-5_17","DOIUrl":"https://doi.org/10.1007/978-3-030-64843-5_17","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129336068","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
Optimal Deterministic Group Testing Algorithms to Estimate the Number of Defectives 估计缺陷数量的最优确定性组测试算法
International Conference on Combinatorial Optimization and Applications Pub Date : 2020-09-05 DOI: 10.1007/978-3-030-64843-5_27
N. Bshouty, Catherine A. Haddad-Zaknoon
{"title":"Optimal Deterministic Group Testing Algorithms to Estimate the Number of Defectives","authors":"N. Bshouty, Catherine A. Haddad-Zaknoon","doi":"10.1007/978-3-030-64843-5_27","DOIUrl":"https://doi.org/10.1007/978-3-030-64843-5_27","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126706039","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学术官方微信