Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/wads/DeshpandeKDS07
%A Deshpande, Ajay
%A Kim, Taejung
%A Demaine, Erik D.
%A Sarma, Sanjay E.
%B WADS
%D 2007
%E Dehne, Frank K. H. A.
%E Sack, Jörg-Rüdiger
%E Zeh, Norbert
%I Springer
%K dblp
%P 163-174
%T A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems.
%U http://dblp.uni-trier.de/db/conf/wads/wads2007.html#DeshpandeKDS07
%V 4619
%@ 978-3-540-73948-7
@inproceedings{conf/wads/DeshpandeKDS07,
added-at = {2018-11-14T00:00:00.000+0100},
author = {Deshpande, Ajay and Kim, Taejung and Demaine, Erik D. and Sarma, Sanjay E.},
biburl = {https://www.bibsonomy.org/bibtex/2130ef0b35324e66984bfbed4d0ea9abb/dblp},
booktitle = {WADS},
crossref = {conf/wads/2007},
editor = {Dehne, Frank K. H. A. and Sack, Jörg-Rüdiger and Zeh, Norbert},
ee = {https://www.wikidata.org/entity/Q56504465},
interhash = {0e1560c357f9adaf6d83109bf38f5ef2},
intrahash = {130ef0b35324e66984bfbed4d0ea9abb},
isbn = {978-3-540-73948-7},
keywords = {dblp},
pages = {163-174},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2019-05-15T14:53:45.000+0200},
title = {A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems.},
url = {http://dblp.uni-trier.de/db/conf/wads/wads2007.html#DeshpandeKDS07},
volume = 4619,
year = 2007
}