01190nac a22002051u 4500020002800000082001600028090001300044100003400057245005300091260005000144300003600194504006600230505040200296650002500698650003900723700001900762942001800781999001300799952017200812  a0321295358 (alk. paper)  a005.1bK645  c570d570  aKleinberg, Jon.                aAlgorithm design /cJon Kleinberg, Éva Tardos.  aLondon :bPearson/Addison-Wesley,2006cc2006.  axxiii, 838 p. :bill. ;c24 cm.  aIncludes bibliographical references (p. [805]-814) and index.0 antroduction: 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.  aComputer algorithms.  aData structures (Computer science)1 aTardos, Éva.  cBBk005.1K645  c570d570  00102ddc3Lost_In_Inventory_11-6-202440708 aMAINbMAINcLOWd2006-07-18epurchaseg195.00l5m1o005.1 KLEp000004045r2025-07-15 00:00:00s2013-10-10v243.75yBB