<?xml version="1.0" encoding="UTF-8"?>
<collection 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">
 <record>
  <leader>00000cmm a22000005i 4500</leader>
  <controlfield tag="001">UP-99796217611058120</controlfield>
  <controlfield tag="003">Buklod</controlfield>
  <controlfield tag="005">20241008105412.0</controlfield>
  <controlfield tag="006">m    go  j        </controlfield>
  <controlfield tag="007">cr |n |||auu|a</controlfield>
  <controlfield tag="008">241008s2011    gw     go  j        eng  </controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
   <subfield code="a">9783642229350 (eBook)</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(iLib)UPD-00210204937</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
   <subfield code="a">DLC</subfield>
   <subfield code="d">DMLR</subfield>
   <subfield code="e">rda</subfield>
  </datafield>
  <datafield tag="041" ind1=" " ind2=" ">
   <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="042" ind1=" " ind2=" ">
   <subfield code="a">DMLUC</subfield>
  </datafield>
  <datafield tag="084" ind1=" " ind2=" ">
   <subfield code="a">QA 75.5 </subfield>
   <subfield code="b">I643 2011eb</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Goldberg, Leslie Ann.</subfield>
   <subfield code="e">editor.</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Approximation, randomization, and combinatorial optimization. Algorithms and techniques</subfield>
   <subfield code="b">14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings</subfield>
   <subfield code="h">[electronic resource]</subfield>
   <subfield code="c">edited by Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D. P. Rolim.</subfield>
  </datafield>
  <datafield tag="264" ind1=" " ind2="1">
   <subfield code="a">Berlin, Heidelberg</subfield>
   <subfield code="b">Springer Berlin Heidelberg</subfield>
   <subfield code="c">2011.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
   <subfield code="a">1 online resource (XV, 702 pages)</subfield>
  </datafield>
  <datafield tag="336" ind1=" " ind2=" ">
   <subfield code="a">text</subfield>
   <subfield code="2">rdacontent</subfield>
  </datafield>
  <datafield tag="337" ind1=" " ind2=" ">
   <subfield code="a">computer</subfield>
   <subfield code="2">rdamedia</subfield>
  </datafield>
  <datafield tag="338" ind1=" " ind2=" ">
   <subfield code="a">online resource</subfield>
   <subfield code="2">rdacarrier</subfield>
   <subfield code="b">cr</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
   <subfield code="a">This book constitutes the joint refereed proceedings of the 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2011, and the 15th International Workshop on Randomization and Computation, RANDOM 2011, held in Princeton, New Jersey, USA, in August 2011. The volume presents 29 revised full papers of the APPROX 2011 workshop, selected from 66 submissions, and 29 revised full papers of the RANDOM 2011 workshop, selected from 64 submissions. They were carefully reviewed and selected for inclusion in the book. In addition two abstracts of invited talks are included. APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.</subfield>
  </datafield>
  <datafield tag="533" ind1=" " ind2=" ">
   <subfield code="a">Electronic reproduction.</subfield>
   <subfield code="b">New York</subfield>
   <subfield code="c">SpringerLink</subfield>
   <subfield code="d">2011.</subfield>
   <subfield code="n">Available via World Wide Web through SpringerLink.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Computer science.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Data structures (Computer science).</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Computer software.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Computational complexity.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Computer graphics.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Computer science</subfield>
   <subfield code="x">Statistical methods</subfield>
   <subfield code="v">Congresses.</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="0">
   <subfield code="a">Computer algorithms</subfield>
   <subfield code="v">Congresses.</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Jansen, Klaus.</subfield>
   <subfield code="e">editor.</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Ravi, R.</subfield>
   <subfield code="e">editor.</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Rolim, José D. P.</subfield>
   <subfield code="e">editor.</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://link.springer.com/book/10.1007/978-3-642-22935-0</subfield>
   <subfield code="y">Available for University of the Philippines Diliman via SpringerLink. Click here to access</subfield>
  </datafield>
  <datafield tag="905" ind1=" " ind2=" ">
   <subfield code="a">FO</subfield>
  </datafield>
  <datafield tag="852" ind1="0" ind2=" ">
   <subfield code="a">UPD</subfield>
   <subfield code="b">DMLR</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
   <subfield code="a">Electronic Resource</subfield>
  </datafield>
 </record>
</collection>
