<?xml version="1.0" encoding="US-ASCII"?>
<dblp>
<article key="journals/dcg/AryaFM17" mdate="2020-03-12">
<author>Sunil Arya</author>
<author orcid="0000-0002-9807-028X">Guilherme Dias da Fonseca</author>
<author orcid="0000-0002-3290-8932">David M. Mount</author>
<title>On the Combinatorial Complexity of Approximating Polytopes.</title>
<pages>849-870</pages>
<year>2017</year>
<volume>58</volume>
<journal>Discret. Comput. Geom.</journal>
<number>4</number>
<ee>https://doi.org/10.1007/s00454-016-9856-5</ee>
<ee>https://www.wikidata.org/entity/Q59545298</ee>
<url>db/journals/dcg/dcg58.html#AryaFM17</url>
</article></dblp>
