MARC 닫기
00636nam ac200217 k 4500
000003867219
20220101120000
ta
050923s1999 si 000 eng
▼a 9810237405
▼a 123456
▼c 123456
▼d 211070
▼l WM6988
▼a QA76.9.A43
▼a QA76.9.A43
▼b A464
▼a Alsuwaiyel,M.H
▼a Algorithms : design techniques and analysis/
▼d Alsuwaiyel,M.H.
▼a Singapore:
▼b World Scientific,
▼c 1999.
▼a xix,523p.;
▼c 23cm.
▼a Lecture Notes Series on Computing;
▼v 7
▼a Computer algorithms
▼a Data structure (Computer science)
▼b US$97
▼a 단행본
| 자료유형 : | 단행본 |
|---|---|
| ISBN : | 9810237405 |
| 분류기호 : | QA76.9.A43 |
| 개인저자 : | Alsuwaiyel,M.H |
| 서명/저자사항 : | Algorithms : design techniques and analysis/ Alsuwaiyel,M.H. |
| 발행사항 : | Singapore: World Scientific, 1999. |
| 형태사항 : | xix,523p.; 23cm. |
| 총서사항 : | Lecture Notes Series on Computing; 7 |
| 언어 | 영어 |
Part 1 Basic Concepts and Introduction to Algorithms
1. Basic Concepts in Algorithmic Analysis
2. Mathematical Preliminaries
3. Data Structures
4. Heaps and the Disjoint Sets Data Structures
Part 2 Techniques Based on Recursion
5. Introduction
6. Divide and Conquer
7. Dynamic Programming
Part 3 First-Cut Techniques
8. The Greedy Approach
9. Graph Traversal
Part 4 Complexity of Problems
10. NP-Complete Problems
11. Introduction to Computational Complexity
12. Lower Bounds
Part 5 Coping with Hardness
13. Backtracking
14. Randomized Algorithms
15. Approximation Algorithms
Part 6 Iterative Improvement for Domain-Specific Problems
16. Network Flow
17. Matching
Part 7 Techniques in Computational Geometry
18. Geometric Sweeping
19. Voronoi Diagrams
Multivariate data analysis 8th ed
QA278 H153
서평쓰기