Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/420544
Title: Approximation algorithms for facility location prob lems in graphs
Researcher: Jena, Sangram Kishor
Guide(s): Das, Gautam Kumar
Keywords: Mathematics
Physical Sciences
University: Indian Institute of Technology Guwahati
Completed Date: 2021
Abstract: Dominating set and its variants have been studied extensively in the literature and are of broad and current research interest to many researchers due to its wide range of applications including but not limited to networks VLSI clustering map labeling coding theory etc In this thesis minimum dominating set problem and some of its variants such as maximum distance d independent set minimum distance d dominating set minimum d distance m tuple r dominating set minimum vertex edg...
Pagination: Not Available
URI: http://hdl.handle.net/10603/420544
Appears in Departments:DEPARTMENT OF MATHEMATICS

Files in This Item:
File Description SizeFormat 
01_fulltext.pdfAttached File2.13 MBAdobe PDFView/Open
04_abstract.pdf147.75 kBAdobe PDFView/Open
80_recommendation.pdf329 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: