Guarding terrains via local search

Guarding terrains via local search

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 contribut...

Full description

Bibliographic Details
Main Authors: Erik Krohn, Matt Gibson, Gaurav Kanade, Kasturi Varadarajan
Format: Article
Language:English
Published: Carleton University 2014-05-01
Series:Journal of Computational Geometry
Online Access:http://jocg.org/index.php/jocg/article/view/128
id doaj-3ee893e9cfbf4dc2b2a9d16224ef4123
record_format Article
spelling doaj-3ee893e9cfbf4dc2b2a9d16224ef41232020-11-24T22:45:34ZengCarleton UniversityJournal of Computational Geometry1920-180X2014-05-015110.20382/jocg.v5i1a952Guarding terrains via local searchErik Krohn0Matt GibsonGaurav KanadeKasturi VaradarajanUniversity of Wisconsin - OshkoshWe 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.http://jocg.org/index.php/jocg/article/view/128
collection DOAJ
language English
format Article
sources DOAJ
author Erik Krohn
Matt Gibson
Gaurav Kanade
Kasturi Varadarajan
spellingShingle Erik Krohn
Matt Gibson
Gaurav Kanade
Kasturi Varadarajan
Guarding terrains via local search
Journal of Computational Geometry
author_facet Erik Krohn
Matt Gibson
Gaurav Kanade
Kasturi Varadarajan
author_sort Erik Krohn
title Guarding terrains via local search
title_short Guarding terrains via local search
title_full Guarding terrains via local search
title_fullStr Guarding terrains via local search
title_full_unstemmed Guarding terrains via local search
title_sort guarding terrains via local search
publisher Carleton University
series Journal of Computational Geometry
issn 1920-180X
publishDate 2014-05-01
description 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.
url http://jocg.org/index.php/jocg/article/view/128
work_keys_str_mv AT erikkrohn guardingterrainsvialocalsearch
AT mattgibson guardingterrainsvialocalsearch
AT gauravkanade guardingterrainsvialocalsearch
AT kasturivaradarajan guardingterrainsvialocalsearch
_version_ 1725687989792669696

Similar Items