找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Computing and Combinatorics; 18th Annual Internat Joachim Gudmundsson,Julián Mestre,Taso Viglas Conference proceedings 2012 Springer-Verlag

[复制链接]
查看: 20035|回复: 64
发表于 2025-3-21 19:35:29 | 显示全部楼层 |阅读模式
书目名称Computing and Combinatorics
副标题18th Annual Internat
编辑Joachim Gudmundsson,Julián Mestre,Taso Viglas
视频video
概述Up-to-date results.State-of-the-art research.Fast-track conference proceedings
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Computing and Combinatorics; 18th Annual Internat Joachim Gudmundsson,Julián Mestre,Taso Viglas Conference proceedings 2012 Springer-Verlag
描述This book constitutes the refereed proceedings of the 18th Annual International Conference on Computing and Combinatorics, held in Sydney, Australia, in August 2012..The 50 revised full papers presented were carefully reviewed and selected from 121 submissions. Topics  covered are algorithms and data structures; algorithmic game theory and online algorithms; automata, languages, logic, and computability; combinatorics related to algorithms and complexity; complexity theory; computational learning theory and knowledge discovery; cryptography, reliability and security, and database theory; computational biology and bioinformatics; computational algebra, geometry, and number theory; graph drawing and information visualization; graph theory, communication networks, and optimization.
出版日期Conference proceedings 2012
关键词approximation; data structure; one-way function; pseudorandom generator; traveling salesman problem; algo
版次1
doihttps://doi.org/10.1007/978-3-642-32241-9
isbn_softcover978-3-642-32240-2
isbn_ebook978-3-642-32241-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2012
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

 

0票 0.00%

Good and Satisfactory

 

1票 100.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:44:38 | 显示全部楼层
发表于 2025-3-22 03:27:51 | 显示全部楼层
Speed Scaling for Maximum Lateness,teness. We consider two variants of the problem: In the . variant we aim in finding a schedule minimizing the maximum lateness for a given budget of energy, while in the . variant our objective is to find a schedule minimizing a linear combination of maximum lateness and energy. We present polynomia
发表于 2025-3-22 05:12:52 | 显示全部楼层
Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?,ph. For instance, the larger the maximum independent set of the pattern graph is the more efficient algorithms are known. The situation seems to be substantially different in the case of induced subgraph isomorphism for pattern graphs of fixed size. We present two results which provide evidence that
发表于 2025-3-22 12:26:08 | 显示全部楼层
Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs,ected planar graph with . vertices embedded in the plane. The algorithm takes .(.) time per sample, after an initial .(..) preprocessing time during which the algorithm computes the number of all such contiguous minimum cuts. Contiguous cuts (that is, cuts where a naturally defined boundary around t
发表于 2025-3-22 13:37:53 | 显示全部楼层
发表于 2025-3-22 18:39:26 | 显示全部楼层
发表于 2025-3-22 21:41:35 | 显示全部楼层
发表于 2025-3-23 03:25:39 | 显示全部楼层
An Improved Algorithm for Packing ,-Paths in Inner Eulerian Networks, we mean a simple directed path connecting distinct terminals with all intermediate nodes in . − .. This paper concerns the problem of finding a maximum .-path packing, i.e. a maximum collection of arc-disjoint .-paths..A min-max relation for this problem was established by Lomonosov. The capacitate
发表于 2025-3-23 07:04:32 | 显示全部楼层
Towards Optimal and Expressive Kernelization for ,-Hitting Set,me data reduction for problems formalizable as .-., the problem of covering all hyperedges (of cardinality at most .) of a hypergraph by at most . vertices. Additionally, in fault diagnosis, sunflowers yield concise explanations for “highly defective structures”. We provide a linear-time algorithm t
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-2 14:37
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表