<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>01156nac a22002051u 4500</leader>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">0321295358 (alk. paper)</subfield>
  </datafield>
  <datafield tag="082" ind1=" " ind2=" ">
    <subfield code="a">005.1</subfield>
    <subfield code="b">K645</subfield>
  </datafield>
  <datafield tag="090" ind1=" " ind2=" ">
    <subfield code="c">570</subfield>
    <subfield code="d">570</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Kleinberg, Jon.              </subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Algorithm design /</subfield>
    <subfield code="c">Jon Kleinberg, &#xC9;va Tardos.</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">London :</subfield>
    <subfield code="b">Pearson/Addison-Wesley,2006</subfield>
    <subfield code="c">c2006.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">xxiii, 838 p. :</subfield>
    <subfield code="b">ill. ;</subfield>
    <subfield code="c">24 cm.</subfield>
  </datafield>
  <datafield tag="504" ind1=" " ind2=" ">
    <subfield code="a">Includes bibliographical references (p. [805]-814) and index.</subfield>
  </datafield>
  <datafield tag="505" ind1="0" ind2=" ">
    <subfield code="a">ntroduction: 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.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
    <subfield code="a">Computer algorithms.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
    <subfield code="a">Data structures (Computer science)</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
    <subfield code="a">Tardos, &#xC9;va.</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">BB</subfield>
    <subfield code="k">005.1K645</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">570</subfield>
    <subfield code="d">570</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="2">ddc</subfield>
    <subfield code="3">Lost_In_Inventory_11-6-2024</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="8"> </subfield>
    <subfield code="a">MAIN</subfield>
    <subfield code="b">MAIN</subfield>
    <subfield code="c">LOW</subfield>
    <subfield code="d">2006-07-18</subfield>
    <subfield code="e">purchase</subfield>
    <subfield code="g">195.00</subfield>
    <subfield code="l">5</subfield>
    <subfield code="m">1</subfield>
    <subfield code="o">005.1 KLE</subfield>
    <subfield code="p">000004045</subfield>
    <subfield code="r">2025-07-15 00:00:00</subfield>
    <subfield code="s">2013-10-10</subfield>
    <subfield code="v">243.75</subfield>
    <subfield code="y">BB</subfield>
  </datafield>
</record>
