Algorithms for geometric covering problems

dc.contributor.guide	Das, Gautam Kumar
dc.coverage.spatial	Mathematics
dc.creator.researcher	Manjanna, B
dc.date.accessioned	2023-04-26T10:58:31Z
dc.date.available	2023-04-26T10:58:31Z
dc.date.awarded	2016
dc.date.completed	2016
dc.date.registered	2011
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 p
dc.description.note	Not Available
dc.format.accompanyingmaterial	None
dc.format.dimensions	Not Available
dc.format.extent	Not Available
dc.identifier.uri	http://hdl.handle.net/10603/479501
dc.language	English
dc.publisher.institution	DEPARTMENT OF MATHEMATICS
dc.publisher.place	Guwahati
dc.publisher.university	Indian Institute of Technology Guwahati
dc.relation	Not Available
dc.rights	self
dc.source.university	University
dc.subject.keyword	Mathematics
dc.subject.keyword	Physical Sciences
dc.title	Algorithms for geometric covering problems
dc.title.alternative	Not available
dc.type.degree	Ph.D.