Algorithms(4th.Edition)pdf

最新推荐文章于 2021-10-03 13:25:44 发布

weixin_30847939

最新推荐文章于 2021-10-03 13:25:44 发布

阅读量1.1k

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/long12365/p/9730171.html

本文集包含第四届国际优化问题近似算法研讨会(APPROX 2001)及第五届计算机科学领域随机化与近似技术国际研讨会(RANDOM 2001)的论文精选。共收录26篇全文，涉及近似算法的设计与分析、随机化方法、调度、路由、图着色、计算几何等多个方面。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

下载地址：网盘下载

在线阅读本书

This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.
下载地址：网盘下载

转载于:https://www.cnblogs.com/long12365/p/9730171.html