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

International Conference on Combinatorial Optimization and Applications最新文献

筛选
英文 中文
A Novel Virtual Traffic Light Algorithm Based on V2V for Single Intersection in Vehicular Networks 基于V2V的车辆网络单交叉口虚拟交通灯算法
International Conference on Combinatorial Optimization and Applications Pub Date : 2019-12-13 DOI: 10.1007/978-3-030-36412-0_19
Longjiang Guo, De Wang, Peng Li, Lichen Zhang, Meirei Ren, Hong Liu, A'na Wang
{"title":"A Novel Virtual Traffic Light Algorithm Based on V2V for Single Intersection in Vehicular Networks","authors":"Longjiang Guo, De Wang, Peng Li, Lichen Zhang, Meirei Ren, Hong Liu, A'na Wang","doi":"10.1007/978-3-030-36412-0_19","DOIUrl":"https://doi.org/10.1007/978-3-030-36412-0_19","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122704039","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 One-Cop-Moves Game on Graphs of Small Treewidth 小树宽图上的一警棋博弈
International Conference on Combinatorial Optimization and Applications Pub Date : 2019-12-13 DOI: 10.1007/978-3-030-36412-0_42
Lusheng Wang, Boting Yang
{"title":"The One-Cop-Moves Game on Graphs of Small Treewidth","authors":"Lusheng Wang, Boting Yang","doi":"10.1007/978-3-030-36412-0_42","DOIUrl":"https://doi.org/10.1007/978-3-030-36412-0_42","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129299804","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
Card-Based Secure Ranking Computations 基于卡片的安全排名计算
International Conference on Combinatorial Optimization and Applications Pub Date : 2019-12-13 DOI: 10.1007/978-3-030-36412-0_37
Ken Takashima, Yuta Abe, Tatsuya Sasaki, Daiki Miyahara, Kazumasa Shinagawa, T. Mizuki, H. Sone
{"title":"Card-Based Secure Ranking Computations","authors":"Ken Takashima, Yuta Abe, Tatsuya Sasaki, Daiki Miyahara, Kazumasa Shinagawa, T. Mizuki, H. Sone","doi":"10.1007/978-3-030-36412-0_37","DOIUrl":"https://doi.org/10.1007/978-3-030-36412-0_37","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128010006","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}
引用次数: 8
Approximation Algorithms for Some Minimum Postmen Cover Problems 一类最小邮差覆盖问题的逼近算法
International Conference on Combinatorial Optimization and Applications Pub Date : 2019-12-13 DOI: 10.1007/978-3-030-36412-0_30
Yuying Mao, Wei Yu, Zhaohui Liu, Jiafeng Xiong
{"title":"Approximation Algorithms for Some Minimum Postmen Cover Problems","authors":"Yuying Mao, Wei Yu, Zhaohui Liu, Jiafeng Xiong","doi":"10.1007/978-3-030-36412-0_30","DOIUrl":"https://doi.org/10.1007/978-3-030-36412-0_30","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130750504","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}
引用次数: 5
Scheduling Game with Machine Modification in the Random Setting 随机设置下机器修改调度博弈
International Conference on Combinatorial Optimization and Applications Pub Date : 2019-12-13 DOI: 10.1007/978-3-030-36412-0_21
Chaoyu He, Z. Tan
{"title":"Scheduling Game with Machine Modification in the Random Setting","authors":"Chaoyu He, Z. Tan","doi":"10.1007/978-3-030-36412-0_21","DOIUrl":"https://doi.org/10.1007/978-3-030-36412-0_21","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133156642","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 Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs 平衡连通子图问题:有界度图和有界直径图的复杂性结果
International Conference on Combinatorial Optimization and Applications Pub Date : 2019-12-13 DOI: 10.1007/978-3-030-36412-0_36
Benoît Darties, R. Giroudeau, J. König, Valentin Pollet
{"title":"The Balanced Connected Subgraph Problem: Complexity Results in Bounded-Degree and Bounded-Diameter Graphs","authors":"Benoît Darties, R. Giroudeau, J. König, Valentin Pollet","doi":"10.1007/978-3-030-36412-0_36","DOIUrl":"https://doi.org/10.1007/978-3-030-36412-0_36","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114486106","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
A Task Assignment Approach with Maximizing User Type Diversity in Mobile Crowdsensing 移动群体感知中用户类型多样性最大化的任务分配方法
International Conference on Combinatorial Optimization and Applications Pub Date : 2019-12-13 DOI: 10.1007/978-3-030-36412-0_40
A'na Wang, Lichen Zhang, Longjiang Guo, Meirui Ren, Peng Li, Bin Yan
{"title":"A Task Assignment Approach with Maximizing User Type Diversity in Mobile Crowdsensing","authors":"A'na Wang, Lichen Zhang, Longjiang Guo, Meirui Ren, Peng Li, Bin Yan","doi":"10.1007/978-3-030-36412-0_40","DOIUrl":"https://doi.org/10.1007/978-3-030-36412-0_40","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"1 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132407690","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
Contact Representations of Directed Planar Graphs in 2D and 3D 二维和三维有向平面图的接触表示
International Conference on Combinatorial Optimization and Applications Pub Date : 2019-12-13 DOI: 10.1007/978-3-030-36412-0_7
Chun-Hsiang Chan, H. Yen
{"title":"Contact Representations of Directed Planar Graphs in 2D and 3D","authors":"Chun-Hsiang Chan, H. Yen","doi":"10.1007/978-3-030-36412-0_7","DOIUrl":"https://doi.org/10.1007/978-3-030-36412-0_7","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132948084","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
Characterizations for Special Directed Co-graphs 特殊有向图的刻画
International Conference on Combinatorial Optimization and Applications Pub Date : 2019-12-13 DOI: 10.1007/978-3-030-36412-0_20
Frank Gurski, Dominique Komander, Carolin Rehs
{"title":"Characterizations for Special Directed Co-graphs","authors":"Frank Gurski, Dominique Komander, Carolin Rehs","doi":"10.1007/978-3-030-36412-0_20","DOIUrl":"https://doi.org/10.1007/978-3-030-36412-0_20","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116048583","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}
引用次数: 4
New Results on a Family of Geometric Hitting Set Problems in the Plane 平面上一类几何碰撞集问题的新结果
International Conference on Combinatorial Optimization and Applications Pub Date : 2019-12-13 DOI: 10.1007/978-3-030-36412-0_31
Joseph S. B. Mitchell, S. Pandit
{"title":"New Results on a Family of Geometric Hitting Set Problems in the Plane","authors":"Joseph S. B. Mitchell, S. Pandit","doi":"10.1007/978-3-030-36412-0_31","DOIUrl":"https://doi.org/10.1007/978-3-030-36412-0_31","url":null,"abstract":"","PeriodicalId":149649,"journal":{"name":"International Conference on Combinatorial Optimization and Applications","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127011431","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学术文献互助群
群 号：481959085
Book学术官方微信