您的位置： 首页 » 图书频道 > 图书 > 小说 > 科学技术 > Algorithms - ESA 2001 算法―ESA 2001
| 网上商家 | 商家服务 | 商品规格 | 价格 | 购买信息 |
 187条评论
|
|
Algorithms - ESA 2001 算法―ESA 2001 点击数：1000 |
325.80元 | 去看看 |
0条评论
|
|
Algorithms-Esa 2001 点击数：1000 |
796.13元 | 去看看 |
8条评论
|
|
Algorithms-ESA 2001(英文原版进口) 点击数：1000 |
1260.00元 | 去看看 |
950条评论
|
|
Algorithms-ESA 2001(算法—ESA 2001) 点击数：1000 |
93.50元 | 去看看 |
Sponser Links
Algorithms - ESA 2001 算法―ESA 2001产品介绍
| 类别 | 科学技术 |
| 作者 | FriedhelmMeyeraufderHeide著 |
| 出版社 | 湖南文艺出版社 |
| ISBN | 3540424938 |
| 定价 | 651.63元 |
| 出版时间 | 2001-10-1 |
| 版次 | 1 |
| 页数 | 538 |
| 纸张 | 胶版纸 |
| 包装 | 平装 |
| 内容提要 | 在线阅读本书 This book constitutes the refereed proceedings of the 9th Annual European Symposium on Algorithms, ESA 2001, held in Aarhus, Denmark, in August 2001.The 41 revised full papers presented together with three invited contributions were carefully reviewed and selected from 102 submissions. The papers are organized in topical sections on caching and prefetching, online algorithms, data structures, optimization and approximation, sequences, scheduling, shortest paths, geometry, distributed algorithms, graph algorithms, pricing, broadcasting and multicasting, graph labeling and graph drawing, and graphs. |
| 目录 | Invited Talks External Memory Data Structures (Invited Paper) Some Algorithmic Problems in Large Networks Exact and Approximate Distances in Graphs - A SurveySession 1: Caching and Prefetching Strongly Competitive Algorithms for Caching with Pipelined Prefetching Duality between Prefetching and Queued Writing with Parallel DisksSession 2: Online Algorithms Online Bin Coloring A General Decomposition Theorem for the k-Server Problem Buying a Constant Competitive Ratio for PagingSession 3: Data Structures Ⅰ Simple Minimal Perfect Hashing in Less Space Cuckoo HashingSession 4: Optimization and Approximation Coupling Variable Fixing Algorithms for the Automatic Recording Problem…… Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints On the Approximability of the Minimum Test Collection ProblemSession 5: Sequences Finding Approximate Repetitions under Hamming Distance SNPs Problems Complexity, and AlgorithmsSession 6: Scheduling A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs Grouping Techniques for Scheduling Problems: Simpler and Faster A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling TimesSession 7: Shortest Paths A Simple Shortest Path Algorithm with Linear Average Time A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching AlgorithmsSession 8: Geometry I A Separation Bound for Real Algebraic Expressions Property Testing with Geometric Queries Smallest Color-Spanning Objects.Sessiong 9：Data StructuresⅡSessiong 10: GeometryⅡSessiong 11: Distributed AlgorithmsSessiong 12: Graph AlgorithmsSessiong 13: PricingSessiong 14: Broadcasting and MulticastingSessiong 15: Graph Labeling and Graph DrawingSessiong 16: GraphsAuthor Index |
选中与当前商品进行对比Algorithms - ESA 2001 算法―ESA 2001相关评论
暂无购买记录
Algorithms - ESA 2001 算法―ESA 2001相关新闻
