Algorithms for Geometric Covering Problems

Simple item page
dc.contributor.authorManjanna, B
dc.date.accessioned2016-08-24T05:10:53Z
dc.date.accessioned2023-10-20T12:30:39Z
dc.date.available2016-08-24T05:10:53Z
dc.date.available2023-10-20T12:30:39Z
dc.date.issued2016
dc.descriptionSupervisor: Gautam Kumar Dasen_US
dc.description.abstractMotivated 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.identifier.otherROLL NO. 11612315
dc.identifier.urihttps://gyan.iitg.ac.in/handle/123456789/730
dc.language.isoenen_US
dc.relation.ispartofseriesTH-1505;
dc.subjectMATHEMATICSen_US
dc.titleAlgorithms for Geometric Covering Problemsen_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
Abstract-TH-1505_11612315.pdf
Size:
110.78 KB
Format:
Adobe Portable Document Format
Description:
Abstract
Download
No Thumbnail Available
Name:
TH-1505_11612315.pdf
Size:
1005.48 KB
Format:
Adobe Portable Document Format
Description:
Thesis
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description:
Download
Collections
PhD Theses (Mathematics)