000 01770cam a2200457 i 4500
999 _c200454674
_d72886
003 TR-AnTOB
005 20231004154401.0
007 ta
008 231003t20142014enka b 001 0 eng d
015 _aGBB443068
_2bnb
016 7 _a016539175
_2Uk
020 _a9781292023946
_q(paperback)
020 _a1292023945
_q(paperback)
029 1 _aAU@
_b000052957520
029 1 _aUKMGB
_b016539175
035 _a(OCoLC)877621746
035 _a(TR-AnTOB)200454674
040 _aNLE
_beng
_erda
_cNLE
_dOCLCO
_dOCLCQ
_dYDX
_dUKMGB
_dCLO
_dTR-AnTOB
041 0 _aeng
050 4 _aQA76.9.A43
_bK54 2014
090 _aQA76.9.A43
_bK54 2014
100 1 _aKleinberg, Jon
_eauthor
_920538
245 1 0 _aAlgorithm design /
_cJon Kleinberg, Éva Tardos.
250 _aPearson new international edition.
250 _aFirst edition.
264 1 _aHarlow, Essex :
_bPearson,
_c[2014]
264 4 _c©2014
300 _aii, 823 pages :
_billustrations ;
_c29 cm
336 _atext
_btxt
_2rdacontent
336 _astill image
_bsti
_2rdacontent
337 _aunmediated
_bn
_2rdamedia
338 _avolume
_bnc
_2rdacarrier
504 _aBIBINDX
505 0 _aIntroduction: 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.
650 0 _aComputer algorithms
_9534
650 0 _aData structures (Computer science)
_91407
700 1 _aTardos, Éva
_eauthor
_920539
942 _2lcc
_cRESERVE