| dc.contributor.advisor |
Sanjay E. Sarma. |
en_US |
| dc.contributor.author |
Deshpande, Ajay A |
en_US |
| dc.contributor.other |
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. |
en_US |
| dc.date.accessioned |
2007-02-21T13:13:35Z |
|
| dc.date.available |
2007-02-21T13:13:35Z |
|
| dc.date.copyright |
2006 |
en_US |
| dc.date.issued |
2006 |
en_US |
| dc.identifier.uri |
http://hdl.handle.net/1721.1/36243 |
|
| dc.description |
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering; and, (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006. |
en_US |
| dc.description |
Includes bibliographical references (p. 55-56). |
en_US |
| dc.description.abstract |
In this thesis, we give a pseudo-polynomial time O(log² n)-approximation algorithm for a variant of the art gallery problem the point-guard problem. The point-guard problem involves finding the minimum number of points and their positions so that guards located at these points cover the interior of the art gallery. Our algorithm is pseudo-polynomial in the sense that it is polynomial in the number of walls of the art gallery but is possibly exponential in the number of bits required to represent the positions of the vertices of the art gallery. Our approach involves reducing the point-guard problem to a new problem of choosing a minimum number of guard-locations from a finite set obtained by a special subdivision procedure. The new problem has the optimal solution at most three times the optional solution of the point-guard problem. We further reduce the new problem to the set cover problem and obtain an approximate solution to the set cover problem. |
en_US |
| dc.description.provenance |
Made available in DSpace on 2007-02-21T13:13:35Z (GMT). No. of bitstreams: 2
77272768.pdf: 2603768 bytes, checksum: 041cfecea2e79006c003891af46a9f16 (MD5)
77272768-MIT.pdf: 2603580 bytes, checksum: a6a70a3dce4769069eac5759db17a15b (MD5)
Previous issue date: 2006 |
en |
| dc.description.statementofresponsibility |
by Ajay A. Deshpande. |
en_US |
| dc.format.extent |
56 p. |
en_US |
| dc.language.iso |
eng |
en_US |
| dc.publisher |
Massachusetts Institute of Technology |
en_US |
| dc.rights |
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. |
en_US |
| dc.rights.uri |
http://dspace.mit.edu/handle/1721.1/7582 |
|
| dc.subject |
Mechanical Engineering. |
en_US |
| dc.subject |
Electrical Engineering and Computer Science. |
en_US |
| dc.title |
A pseudo-polynomial time O(log² n)-approximation algorithm for art gallery problems |
en_US |
| dc.type |
Thesis |
en_US |
| dc.description.degree |
S.M. |
en_US |
| dc.contributor.department |
Massachusetts Institute of Technology. Dept. of Mechanical Engineering. |
en_US |
| dc.contributor.department |
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. |
en_US |
| dc.identifier.oclc |
77272768 |
en_US |
