"A Pseudopolynomial Time O (log n )-Approximation Algorithm ..."

Ajay Deshpande et al. (2007)

> Home

Details and statistics

DOI: 10.1007/978-3-540-73951-7_15

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wads/DeshpandeKDS07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wads/DeshpandeKDS07
Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanjay E. Sarma:
A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems. WADS 2007: 163-174

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.