Algorithms for Geometric Covering Problems

Show simple item record

dc.contributor.author Manjanna, B
dc.date.accessioned 2016-08-24T05:10:53Z
dc.date.available 2016-08-24T05:10:53Z
dc.date.issued 2016
dc.identifier.other ROLL NO. 11612315
dc.identifier.uri http://gyan.iitg.ernet.in/handle/123456789/730
dc.description Supervisor: Gautam Kumar Das en_US
dc.description.abstract Motivated by the applications in facility location, VLSI design, image processing and motion planning, geometric covering problems have been studied extensively in the literature. In this thesis various geometric covering problems such as covering points with disks, and squares, covering rectangular regions and convex polygonal regions with disks are considered. The problems are investigated by proposing approximation, parameterized and heuristic algorithms. The Discrete Unit Disk Cover (DUDC) problem is one of the well known geometric covering problems. The DUDC problem is a NP-complete problem. en_US
dc.language.iso en en_US
dc.relation.ispartofseries TH-1505;
dc.subject MATHEMATICS en_US
dc.title Algorithms for Geometric Covering Problems en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search


Browse

My Account