guarding terrains via local search
Clicks: 161
ID: 177656
2014
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
30.0
/100
161 views
31 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #14 of 19 articles by views in canadian journal of infectious diseases and medical microbiology
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algorithm inspired by the recent results of Chan and Har-Peled (SoCG 2009) and Mustafa and Ray (DCG 2010). Our key contribution is to show the existence of a planar graph that appropriately relates the local and global optimum.
| Reference Key |
krohn2014journalguarding
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Erik Krohn;Matt Gibson;Gaurav Kanade;Kasturi Varadarajan |
| Journal | canadian journal of infectious diseases and medical microbiology |
| Year | 2014 |
| DOI |
10.20382/jocg.v5i1a9
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.