Acharyya, Rashmisnata - 2-Median Problems in Tree Networks...

View the thesis

This project has been submitted to the Library for purposes of graduation, but needs to be audited for technical details related to publication in order to be approved for inclusion in the Library collection.
Term: 
Spring 2017
Degree: 
M.Sc.
Degree type: 
Project
Department: 
School of Computing Science
Faculty: 
Applied Sciences
Senior supervisor: 
Binay Bhattacharyya
Co-supervisor, if any: 
Ramesh Krishnamurthi
Thesis title: 
2-Median Problems in Tree Networks
Given Names: 
Rashmisnata
Surname: 
Acharyya
Abstract: 
Facility Location Problems have a great significance for allocating resources efficiently in a network. The interaction mainly involves a price which depends on the distances between the objects and the order of significance of the objects(clients). The applications of such problems are immense in many application areas such as medical and transportation. In this project, we consider the p-median facility location problem in tree-networks. This p-median problem in general tree-networks is NP-hard. In this project, we have looked at efficiently solving the 2-median problem in tree networks. Using simple techniques of computational geometry, we give a O(n log s) time solution to the 2-median of a tree with s number of leaves. Our technique is then applied to solve other variants of the 2-median problem with the same complexity
Keywords: 
Facility Location; 2-median; Link-deletion; Path Partition
Total pages: 
34