Introduction to the Design and Analysis of Algorithms: a strategic approach (IE-Paperback)
暫譯: 演算法設計與分析導論：策略性方法 (IE-Paperback)

R.C.T. Lee, S.S. Tseng, R.C. Chang, Y.T.Tsai

Introduction to the Design and Analysis of Algorithms: a strategic approach (IE-Paperback)

買這商品的人也買了...

相關主題

商品描述

Communication network design, VLSI layout and DNA sequence analysis are important and challenging problems that cannot be solved by naive and straightforward algorithms. Thus, it is critical for a computer scientist to have a good knowledge of algorithm design and analysis.

This book presents algorithm design from the viewpoint of strategies. Each strategy is introduced with many algorithms designed under the strategy. Each algorithm is presented with many examples and each example with many figures.

In recent years, many approximation algorithms have been developed. Introduction to the Design and Analysis of Algorithms presents two important concepts clearly: PTAS and NPO-complete. This book also discusses the concept of NP-completeness before introducing approximation algorithms. Again, this is explained through examples which make sure that the students have a definite idea about this very abstract concept.

In addition, this book also has a chapter on on-line algorithms. Each on-line algorithm is introduced by first describing the basic principle behind it. Amortized analysis is a new field in algorithm research. In this book, detailed descriptions are given to introduce this new and difficult-to-understand concept.

This book can be used as a textbook by senior undergraduate students or master level graduate students in computer science.

商品描述(中文翻譯)

通訊網路設計、VLSI 佈局和 DNA 序列分析是重要且具挑戰性的問題，無法僅透過簡單直接的演算法來解決。因此，對於計算機科學家來說，擁有良好的演算法設計和分析知識是至關重要的。

本書從策略的角度介紹演算法設計。每個策略都會介紹許多在該策略下設計的演算法。每個演算法都會提供多個範例，並且每個範例都會附上多個圖示。

近年來，許多近似演算法已被開發出來。《演算法設計與分析導論》清楚地介紹了兩個重要概念：PTAS 和 NP 完全性。本書在介紹近似演算法之前，還討論了 NP 完全性的概念。這一部分同樣透過範例進行解釋，以確保學生對這一非常抽象的概念有明確的理解。

此外，本書還有一章專門介紹線上演算法。每個線上演算法的介紹都是先描述其背後的基本原則。攤銷分析是演算法研究中的一個新領域。本書詳細描述了這一新且難以理解的概念。

本書可作為計算機科學的高年級本科生或碩士研究生的教科書。

目錄大綱

1 Introduction
2 The complexity of algorithms and the lower bounds of problems
3 The greedy method
4 The divide-and-conquer strategy
5 Tree searching strategies
6 Prune-and-search
7 Dynamic programming
8 The theory of NP-completeness
9 Approximation algorithms
10 Amortized analysis
11 Randomized algorithms
12 On-line algorithms

目錄大綱(中文翻譯)

1 Introduction

2 The complexity of algorithms and the lower bounds of problems

3 The greedy method

4 The divide-and-conquer strategy

5 Tree searching strategies

6 Prune-and-search

7 Dynamic programming

8 The theory of NP-completeness

9 Approximation algorithms

10 Amortized analysis

11 Randomized algorithms

12 On-line algorithms

類似商品