机读格式显示(MARC)
- 000 02052cam 2200613 a 4500
- 008 060221r20062006cc a 001 0 eng d
- 040 __ |a TSU |c TSU |d PUL |d pul
- 099 __ |a CAL 022006011140
- 100 1_ |a Kleinberg, Jon.
- 245 10 |a Algorithm design = |b 算法设计 / |c Jon Kleinberg, Eva Tardos 著.
- 260 __ |a 北京 : |b 清华大学出版社, |c 2006.
- 300 __ |a xxiii, 838 p. : |b ill. ; |c 24 cm.
- 440 _0 |a 大学计算机教育国外著名教材系列
- 504 __ |a Includes bibliographical references (p. [805]-814) and index.
- 505 0_ |a Introduction: Some representative problems -- Basics of algorithms analysis -- Graphs -- Greedy algorithms -- Divide and conquer -- Dynamic programming -- Network flow -- NP and computational intractability -- PSPACE: A class of problems beyond NP -- Extending the limits of tractability -- Approximation algorithms -- Local search -- Randomized algorithms -- Epilogue: algorithms that run forever
- 534 __ |p Reprint. Originally published: |c Boston: Pearson/Addison-Wesley,c2006. |z 0321295358.
- 650 _0 |a Computer algorithms.
- 650 _0 |a Data structures (Computer science)
- 950 __ |a SCNU |f TP301.6/K64
- 999 __ |M zxq |m 20060626 10:48:01 |G zxq |g 20060626 10:49:25
- 907 __ |a SCNU |f TP301.6/K64