定 價:48 元
叢書名:高等院校電氣信息類專業(yè)"互聯(lián)網(wǎng)+"創(chuàng)新規(guī)劃教材
- 作者:汪國華,李艷娟
- 出版時間:2022/3/1
- ISBN:9787301328736
- 出 版 社:北京大學(xué)出版社
- 中圖法分類:TP301.6
- 頁碼:272
- 紙張:
- 版次:1
- 開本:16開
本書共8章,主要從算法的分析與設(shè)計(jì)兩個方面進(jìn)行介紹。首先,系統(tǒng)地介紹了算法分析的基本方法,包括非遞歸算法和遞歸算法,并詳細(xì)介紹了Master定理。然后,系統(tǒng)地介紹了各種算法設(shè)計(jì)策略,包括分治策略、動態(tài)規(guī)劃算法、貪心算法、回溯法、分支限界法、線性規(guī)劃與網(wǎng)絡(luò)流等。對于每種算法設(shè)計(jì)策略,從該策略的基本思想、適用問題、算法步驟或框架、應(yīng)用范例等多個方面詳細(xì)講解,對于復(fù)雜的算法設(shè)計(jì)策略還給出了相關(guān)例題。書中包含大量的范例和對應(yīng)的實(shí)現(xiàn)代碼,讓讀者對算法設(shè)計(jì)策略的基本思想和核心設(shè)計(jì)步驟有深入的理解與掌握,能夠讓讀者掌握各種算法設(shè)計(jì)策略的精髓,能夠提高讀者的算法設(shè)計(jì)能力,能夠讓讀者具備分析具體問題、選擇算法設(shè)計(jì)策略、給出算法代碼的能力。
本書主要作為普通高校教材,適用于計(jì)算機(jī)科學(xué)與技術(shù)相關(guān)專業(yè)的本科和研究生階段的教材,也可以作為從事實(shí)際問題求解的研究工作者的入門教材。
汪國華,博士,教授,博士生導(dǎo)師,東北林業(yè)大學(xué)!端惴ㄔO(shè)計(jì)與分析》課程組負(fù)責(zé)人,主持校教育教學(xué)研究項(xiàng)目1項(xiàng)。該課程已經(jīng)評為了校一流在線課程,并獲得了校《優(yōu)秀研究生教材建設(shè)》項(xiàng)目。目前擔(dān)任東北林業(yè)大學(xué)信息與計(jì)算機(jī)工程學(xué)院院長,一直致力于人工智能、大數(shù)據(jù)領(lǐng)域與生命、林學(xué)、其他工科領(lǐng)域的多學(xué)科交叉的教育模式探索?蒲蟹较蚴侨斯ぶ悄芎蜕镄畔W(xué),主要是利用海量生物高通量數(shù)據(jù)進(jìn)行基因組組裝與比對算法設(shè)計(jì)、疾病調(diào)控機(jī)制、單細(xì)胞分類模型研究。作為負(fù)責(zé)人主持國家863項(xiàng)目1項(xiàng),863子課題項(xiàng)目1項(xiàng),國家自然科學(xué)基金3項(xiàng)等。2013年入選教育部“新世紀(jì)優(yōu)秀人才支持計(jì)劃”,2014年入選國家博士后基金會百名博士后國際交流計(jì)劃派出項(xiàng)目。2011年博士學(xué)位論文獲得中國計(jì)算機(jī)學(xué)會“2011CCF優(yōu)秀博士學(xué)位論文獎提名”。
李艷娟,女,博士,副教授,碩士生導(dǎo)師,現(xiàn)任衢州學(xué)院電氣與信息工程學(xué)院教師。中國計(jì)算機(jī)學(xué)會(CCF)會員,生物信息學(xué)專委會委員。
主要從事生物信息學(xué),機(jī)器學(xué)習(xí)等研究。主持國家自然科學(xué)基金1項(xiàng),主持省級項(xiàng)目2項(xiàng),主持中央高;4項(xiàng),作為主要成員參與863項(xiàng)目、國家自然科學(xué)基金、省級項(xiàng)目6項(xiàng)。以第一作者或通訊作者發(fā)表論文20多篇,其中SCI、EI檢索18篇。出版教材5部,授權(quán)專利12項(xiàng),計(jì)算機(jī)軟件著作權(quán)9項(xiàng)。
先后承擔(dān)數(shù)據(jù)機(jī)構(gòu),算法設(shè)計(jì)與分析,計(jì)算機(jī)圖形學(xué)等課程主講工作。
第1章 算法概述 ································· 1
1.1 引言·············································· 3
1.2 算法的概念····································· 4
1.3 算法復(fù)雜性分析······························· 8
1.4 本章小結(jié)······································· 16
習(xí)題···················································· 17
第2章 遞歸與分治策略 ······················19
2.1 遞歸············································· 22
2.2 分治策略······································· 28
2.3 分治法求解查找問題························ 30
2.4 分治法求解排序問題························ 33
2.5 分治法求解復(fù)雜計(jì)算問題·················· 38
2.6 分治法求解組合問題························ 51
2.7 本章小結(jié)······································· 55
習(xí)題···················································· 56
第3章 動態(tài)規(guī)劃算法··························59
3.1 動態(tài)規(guī)劃的基本概念························ 62
3.2 備忘錄方法···································· 64
3.3 動態(tài)規(guī)劃算法的總體設(shè)計(jì)思想和
基本要素······································· 65
3.4 矩陣連乘問題································· 67
3.5 最長公共子序列問題························ 74
3.6 0-1背包問題 ·································· 80
3.7 最大子段和問題······························ 83
3.8 凸多邊形最優(yōu)三角剖分····················· 88
3.9 本章小結(jié)······································· 90
習(xí)題···················································· 91
第4章 貪心算法 ································94
4.1 生活中的貪心算法··························· 96
4.2 貪心算法的基本思想························ 98
4.3 活動安排問題································100
4.4 最優(yōu)裝載問題································104
4.5 哈夫曼編碼···································108
4.6 貪心算法的正確性驗(yàn)證····················116
4.7 本章小結(jié)······································117
習(xí)題···················································117
第5章 回溯法·································· 120
5.1 回溯法的基本思想··························122
5.2 回溯法的算法框架··························123
5.3 裝載問題······································127
5.4 批處理作業(yè)調(diào)度問題·······················130
5.5 符號三角形問題·····························133
5.6 0-1背包問題 ·································135
5.7 最大團(tuán)問題···································138
5.8 旅行商問題···································141
5.9 連續(xù)郵資問題································145
5.10 回溯法的效率分析 ························148
5.11 本章小結(jié)·····································149
習(xí)題···················································149
第6章 分支限界法··························· 154
6.1 分支限界法的基本思想····················157
6.2 裝載問題······································161
6.3 布線問題······································171
6.4 0-1背包問題 ·································177
目 錄
算法設(shè)計(jì)與分析(文前+1-4).indd 7 2022/3/9 15:25:03
算法設(shè)計(jì)與分析
VIII
6.5 最大團(tuán)問題···································182
6.6 旅行商問題···································185
6.7 本章小結(jié)······································189
習(xí)題···················································190
第7章 隨機(jī)算法 ······························ 193
7.1 隨機(jī)算法的設(shè)計(jì)思想·······················196
7.2 隨機(jī)數(shù)發(fā)生器································197
7.3 數(shù)值隨機(jī)算法································199
7.4 舍伍德算法···································200
7.5 拉斯維加斯算法·····························203
7.6 蒙特卡羅算法································208
7.7 本章小結(jié)······································210
習(xí)題···················································210
第8章 線性規(guī)劃與網(wǎng)絡(luò)流················· 212
8.1 線性規(guī)劃概述································215
8.2 單純形法的設(shè)計(jì)思想與步驟··············221
8.3 單純形法的描述與分析····················232
8.4 網(wǎng)絡(luò)最大流問題·····························235
8.5 最小費(fèi)用流問題·····························244
8.6 本章小結(jié)······································257
習(xí)題···················································257
參考文獻(xiàn) ·········································· 261