找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Computing and Combinatorics; 19th International C Ding-Zhu Du,Guochuan Zhang Conference proceedings 2013 Springer-Verlag Berlin Heidelberg

[复制链接]
查看: 39350|回复: 63
发表于 2025-3-21 16:39:28 | 显示全部楼层 |阅读模式
书目名称Computing and Combinatorics
副标题19th International C
编辑Ding-Zhu Du,Guochuan Zhang
视频video
概述Up-to-date results.Fast track conference proceedings.State-of-the-art report
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Computing and Combinatorics; 19th International C Ding-Zhu Du,Guochuan Zhang Conference proceedings 2013 Springer-Verlag Berlin Heidelberg
描述This book constitutes the refereed proceedings of the 19th International Conference on Computing and Combinatorics, COCOON 2013, held in Hangzhou, China, in June 2013. The 56 revised full papers presented were carefully reviewed and selected from 120 submissions. There was a co-organized workshop on discrete algorithms of which 8 short papers were accepted and a workshop on computational social networks where 12 papers out of 25 submissions were accepted.
出版日期Conference proceedings 2013
关键词approximation data mining; graph algorithms; graph algorithms; pseudorandom generators; social network a
版次1
doihttps://doi.org/10.1007/978-3-642-38768-5
isbn_softcover978-3-642-38767-8
isbn_ebook978-3-642-38768-5Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2013
The information of publication is updating

书目名称Computing and Combinatorics影响因子(影响力)




书目名称Computing and Combinatorics影响因子(影响力)学科排名




书目名称Computing and Combinatorics网络公开度




书目名称Computing and Combinatorics网络公开度学科排名




书目名称Computing and Combinatorics被引频次




书目名称Computing and Combinatorics被引频次学科排名




书目名称Computing and Combinatorics年度引用




书目名称Computing and Combinatorics年度引用学科排名




书目名称Computing and Combinatorics读者反馈




书目名称Computing and Combinatorics读者反馈学科排名




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

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-22 00:09:02 | 显示全部楼层
https://doi.org/10.1007/978-3-642-66040-5 computed efficiently and interleaving is not needed to achieve optimality. However, in both types of networks, how to find the optimal sequence of execution remains a big challenge for jobs with general workloads.
发表于 2025-3-22 02:11:07 | 显示全部楼层
发表于 2025-3-22 06:14:09 | 显示全部楼层
Optimal Stopping Meets Combinatorial Optimizationorithm to select multiple elements from the sequence, subject to a combinatorial feasibility constraint on the set selected. A sequence of results during the past ten years have contributed greatly to our understanding of these problems. I will survey some of these developments and their applications to topics in algorithmic game theory.
发表于 2025-3-22 12:14:55 | 显示全部楼层
发表于 2025-3-22 14:11:48 | 显示全部楼层
Selection from Read-Only Memory with Limited Workspaceeneralize our algorithm for the case when the size of the workspace is .(.) bits, .. The running time of our generalized algorithm is ., slightly improving over the bound . of Frederickson’s algorithm. Of independent interest, the wavelet stack—a structure we used for repeated pruning—may also be useful in other applications.
发表于 2025-3-22 19:06:48 | 显示全部楼层
Random Methods for Parameterized ProblemsPacking problem, we study the kernel and randomized algorithm for the degree-bounded instance, and then by using the iterative compression technique, a randomized algorithm of running time ..(3.) is given for the Parameterized Co-Path Packing problem, improving the current best result ..(3.24.).
发表于 2025-3-23 00:03:29 | 显示全部楼层
发表于 2025-3-23 01:30:40 | 显示全部楼层
发表于 2025-3-23 07:29:38 | 显示全部楼层
https://doi.org/10.1007/BFb0008699rithm provides an experimental evidence that the correct upper bound is smaller than 2, thus disproving a currently believed conjecture, and can be used to test the validity of a new conjecture we propose, according to which the upper bound would decrease to ../6 + 1/4 ≈ 1.8949.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-29 23:35
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表