<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05764844</id>
  <dt>a</dt>
  <an>05764844</an>
  <augroup>
    <au>Erlebach, Thomas</au>
    <au>van Leeuwen, Erik Jan</au>
  </augroup>
  <ti>Approximating geometric coverage problems.</ti>
  <so>Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, January 20--22, 2008. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-898716-47-4). 1267-1276 (2008).</so>
  <py>2008</py>
  <pu>New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM)</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
  </ligroup>
</item>