About This Book
Newly enlarged, updated second edition of a valuable text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. 153 black-and-white illus. 23 tables. Newl...
More by Te Chiang Hu, Man-tak Shing
Reading Time Estimates
9h 28m
slow reader
180 WPM
6h 49m
average reader
250 WPM
4h 52m
fast reader
350 WPM
π 102,300 wordsπ
14 days at 30 min/day
How Long Will It Take You?
β‘
Get your personal reading time for "Combinatorial Algorithms"
Take a 60-second speed test β we'll calculate how long this book will take you
WPM
Reading time
6 h 49 min
at 250 words per minute
Audiobook (1.5x)
7 h 35 min
at 1.5x narration speed
Audio 1x
11 h 22 min
Audio 2x
5 h 41 min
That's about:
- π 14 daysΒ reading 30 min/day
- π14 commutesΒ of 30 min each