找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Combinatorial Optimization and Applications; 12th International C Donghyun Kim,R. N. Uma,Alexander Zelikovsky Conference proceedings 2018 S

[复制链接]
查看: 23593|回复: 58
发表于 2025-3-21 16:50:50 | 显示全部楼层 |阅读模式
书目名称Combinatorial Optimization and Applications
副标题12th International C
编辑Donghyun Kim,R. N. Uma,Alexander Zelikovsky
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Combinatorial Optimization and Applications; 12th International C Donghyun Kim,R. N. Uma,Alexander Zelikovsky Conference proceedings 2018 S
描述.The conference proceeding  LNCS 11346 constitutes the refereed proceedings of the 12th International Conference on Combinatorial Optimization and Applications, COCOA 2018, held in Atlanta, GA, USA, in December 2018...The 50 full papers presented were carefully reviewed and selected from 106 submissions. The papers cover most aspects of t graph algorithms, routing and network design problems, scheduling algorithms, network optimization, combinatorial algorithms, approximation algorithms, paths and connectivity problems and much more. .
出版日期Conference proceedings 2018
关键词approximation algorithms; computational geometry; data mining; data security; graph theory; heuristic met
版次1
doihttps://doi.org/10.1007/978-3-030-04651-4
isbn_softcover978-3-030-04650-7
isbn_ebook978-3-030-04651-4Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer Nature Switzerland AG 2018
The information of publication is updating

书目名称Combinatorial Optimization and Applications影响因子(影响力)




书目名称Combinatorial Optimization and Applications影响因子(影响力)学科排名




书目名称Combinatorial Optimization and Applications网络公开度




书目名称Combinatorial Optimization and Applications网络公开度学科排名




书目名称Combinatorial Optimization and Applications被引频次




书目名称Combinatorial Optimization and Applications被引频次学科排名




书目名称Combinatorial Optimization and Applications年度引用




书目名称Combinatorial Optimization and Applications年度引用学科排名




书目名称Combinatorial Optimization and Applications读者反馈




书目名称Combinatorial Optimization and Applications读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

1票 100.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:52:15 | 显示全部楼层
发表于 2025-3-22 02:09:44 | 显示全部楼层
发表于 2025-3-22 06:33:31 | 显示全部楼层
Tree ,-Spanners of a Graph: Minimizing Maximum Distances Efficientlyich . has a tree .-spanner is the tree stretch index. The problem of determining the tree stretch index has been studied by: establishing lower and upper bounds, based, for instance, on the girth value and on the minimum diameter spanning tree problem, respectively; and presenting some classes for w
发表于 2025-3-22 10:42:57 | 显示全部楼层
发表于 2025-3-22 15:08:46 | 显示全部楼层
Directed Path-Width of Sequence Digraphsses called sequence digraphs, such that for each of these classes the directed path-width can be computed in polynomial time. For this purpose we define the graph classes . as the set of all digraphs . which can be defined by . sequences with at most . entries from ., such that . if and only if in o
发表于 2025-3-22 17:34:58 | 显示全部楼层
发表于 2025-3-22 21:19:47 | 显示全部楼层
Relaxation and Matrix Randomized Rounding for the Maximum Spectral Subgraph Problempartial subgraph with maximum number of edges and spectral radius bounded above by .. A software-defined network (SDN) capable of real-time topology reconfiguration can then use an algorithm for finding such subgraph to quickly remove spreading malware threats without deploying specific security cou
发表于 2025-3-23 02:17:33 | 显示全部楼层
发表于 2025-3-23 06:19:31 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-24 20:35
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表