Algorithms[electronic resource] :design techniques and analysis

• 作者: Alsuwaiyel, M. H.
• 出版: Singapore : World Scientific c2022.
• 版本: 2nd ed.
• 稽核項: 1 online resource (756 p.).
• 叢書名: Lecture notes series on computing ;vol. 15
• 標題: Algorithms Textbooks. , Algorithms
• ISBN: 9811238650 , 9789811238659
• ISBN: 9789811238642 , 9811238642
• 試查全文@TNUA:
  
• 附註: Includes bibliographical references and index. Basic concepts in algorithmic analysis -- Data structures -- Heaps and the disjoint sets data structures -- Induction -- Divide and conquer -- Dynamic programming -- The greedy approach -- Graph traversal -- NP-complete problems -- Introduction to computational complexity -- Lower bounds -- Backtracking -- Randomized algorithms -- Approximation algorithms -- Network flow -- Matching -- Geometric sweeping -- Voronoi diagrams -- Parallel algorithms.
• 摘要: "Problem solving is an essential part of every scientific discipline. It has two components: (1) problem identification and formulation, and (2) the solution to the formulated problem. One can solve a problem on its own using ad hoc techniques or by following techniques that have produced efficient solutions to similar problems. This required the understanding of various algorithm design techniques, how and when to use them to formulate solutions, and the context appropriate for each of them. This book presents a design thinking approach to problem solving in computing - by first using algorithmic analysis to study the specifications of the problem, before mapping the problem on to data structures, then on to the situatable algorithms. Each technique or strategy is covered in its own chapter supported by numerous examples of problems and their algorithms. The new edition includes a comprehensive chapter on parallel algorithms, and many enhancements"--
• 電子資源: https://dbs.tnua.edu.tw/login?url=https://www.worldscientific.com/worldscibooks/10.1142/12324#t=toc
• 系統號: 005326010
• 資料類型: 電子書
• 讀者標籤: 需登入
• 引用網址: 複製連結
• 目前引用數