How to Keep an Eye on a Few Small Things

DSpace Repository

How to Keep an Eye on a Few Small Things

Show full item record

Files for download

article
Facebook

Simple item record

Publication Conference Paper, peer reviewed
Title How to Keep an Eye on a Few Small Things
Author(s) Nilsson, Bengt J. ; Zylinski, Pawel
Date 2014
English abstract
We present a (k +h)-FPT algorithm for computing a shortest tour that sees k specified points in a polygon with h holes. We also present a k-FPT approximation algorithm for this problem having approximation factor √2. In addition, we prove that the general problem cannot be polynomially approximated better than by a factor of (log n), unless P=NP, where n is the total number of edges of the polygon.
Link http://www.cs.bgu.ac.il/~eurocg14/papers/paper_23.pdf (external link to publication)
Language eng (iso)
Subject(s) Computational Geometry
Visibility
Guarding Tours
Sciences
Research Subject Categories::MATHEMATICS
Note 30th European Workshop on Computational Geometry (EuroCG 2014) Dead Sea, Israel, March 3-5, 2014
Handle http://hdl.handle.net/2043/18192 (link to this page)
Link http://www.cs.bgu.ac.il/~eurocg14/ (external link to related web page)

This item appears in the following Collection(s)

Show full item record

Search


Browse

My Account

Statistics