机读格式显示(MARC)

• 000 01480cam 2200337 a 4500

• 001 0000575437

• 003 CAL

• 005 20070112132700.0

• 008 011126r20042003cc a b 001 0 eng dmaua

• 020 __ |a 7121025809

• 040 __ |a SJT |c JHUL

• 041 0_ |a eng |b chi

• 050 00 |a QA76.9.A43 |b K54 2006

• 082 00 |a 005.1 |2 22

• 090 __ |a TP312AL/K64

• 093 __ |a TP312AL |2 4

• 099 __ |a CAL 022004070617

• 100 1_ |a Kleinberg, Jon.

• 245 10 |a Algorithm design = |b 算法设计 / |c Jon Kleinberg, Eva Tardos著.

• 246 31 |a 算法设计

• 260 __ |a Beijing : |b Qsinghua University Press, |c 2006.

• 300 __ |a xxi, 838 p. : |b ill. ; |c 23 cm.

• 490 1_ |a 大学计算机教育国外著名教材系列(影印版)

• 500 __ |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.

• 504 __ |a Includes bibliographical references (p. 949-952) and index.

• 534 __ |p Reprint. Originally published: |c Boston : Pearson/Addison-Wesley, c2006. |z 0321295358 (alk. paper)

• 650 _0 |a Computer algorithms.

• 650 _0 |a Data structures (Computer science)

• 700 1_ |a Tardos, Eva.

• 830 _0 |a 大学计算机教育国外著名教材系列.

• 950 __ |a JHUL |b TP312AL |c K64