Show brief item record

dc.contributor.authorGibson, Matthew
dc.contributor.authorKanade, Gaurav
dc.contributor.authorKrohn, Erik
dc.contributor.authorVaradarajan, Kasturi
dc.date.accessioned2021-12-07T21:11:41Z
dc.date.available2021-12-07T21:11:41Z
dc.date.issued2014-05-30
dc.identifier.issn1920-180X
dc.identifier.urihttps://hdl.handle.net/20.500.12588/761
dc.description.abstractWe 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.en_US
dc.language.isoen_USen_US
dc.relation.ispartofseriesJournal of Computational Geometry;Vol. 5 No. 1
dc.rightsAttribution 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by/3.0/us/*
dc.titleGuarding Terrains Via Local Searchen_US
dc.typeArticleen_US
dc.description.departmentComputer Scienceen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show brief item record

Attribution 3.0 United States
Except where otherwise noted, this item's license is described as Attribution 3.0 United States