找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Algorithms and Computation; 20th International S Yingfei Dong,Ding-Zhu Du,Oscar Ibarra Conference proceedings 2009 Springer-Verlag Berlin H

[复制链接]
查看: 51452|回复: 65
发表于 2025-3-21 18:34:40 | 显示全部楼层 |阅读模式
期刊全称Algorithms and Computation
期刊简称20th International S
影响因子2023Yingfei Dong,Ding-Zhu Du,Oscar Ibarra
视频video
学科分类Lecture Notes in Computer Science
图书封面Titlebook: Algorithms and Computation; 20th International S Yingfei Dong,Ding-Zhu Du,Oscar Ibarra Conference proceedings 2009 Springer-Verlag Berlin H
影响因子This book constitutes the refereed proceedings of the 20th International Symposium on Algorithms and Computation, ISAAC 2009, held in Honolulu, Hawaii, USA in December 2009. The 120 revised full papers presented were carefully reviewed and selected from 279 submissions for inclusion in the book. This volume contains topics such as algorithms and data structures, approximation algorithms, combinatorial optimization, computational biology, computational complexity, computational geometry, cryptography, experimental algorithm methodologies, graph drawing and graph algorithms, internet algorithms, online algorithms, parallel and distributed algorithms, quantum computing and randomized algorithms.
Pindex Conference proceedings 2009
The information of publication is updating

书目名称Algorithms and Computation影响因子(影响力)




书目名称Algorithms and Computation影响因子(影响力)学科排名




书目名称Algorithms and Computation网络公开度




书目名称Algorithms and Computation网络公开度学科排名




书目名称Algorithms and Computation被引频次




书目名称Algorithms and Computation被引频次学科排名




书目名称Algorithms and Computation年度引用




书目名称Algorithms and Computation年度引用学科排名




书目名称Algorithms and Computation读者反馈




书目名称Algorithms and Computation读者反馈学科排名




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

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:18:49 | 显示全部楼层
发表于 2025-3-22 03:26:08 | 显示全部楼层
发表于 2025-3-22 05:34:15 | 显示全部楼层
发表于 2025-3-22 11:17:41 | 显示全部楼层
发表于 2025-3-22 14:17:32 | 显示全部楼层
On Protein Structure Alignment under Distance Constraint,In this paper we mainly show that the CMO problem under these conditions: (1) is NP-hard, but (2) allows a PTAS. The rest of this paper shows algorithms for the LCP problem which improves on known results.
发表于 2025-3-22 20:24:39 | 显示全部楼层
Bubblesort and Juggling Sequences, to analyze various juggling patterns. The analysis leads to new results on the joint distribution of the descent and maximum drop statistics of a permutation, as well as a new class of identities for the classical Eulerian numbers.
发表于 2025-3-22 22:54:12 | 显示全部楼层
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems,zed where . is a non-negative submodular function on ., and . is a fixed integer. This problem contains the hypergraph .-cut problem. In this paper, we design the first exact algorithm for . = 3 and approximation algorithms for . ≥ 4. We also analyze the approximation factor for the hypergraph .-cut problem.
发表于 2025-3-23 03:18:31 | 显示全部楼层
发表于 2025-3-23 07:26:55 | 显示全部楼层
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153134.jpg
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-28 02:22
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表