The Capacitated Matroid Median Problem

Simple item page
dc.contributor.authorKalhan, Sanchit
dc.date.accessioned2018-05-18T19:38:56Z
dc.date.available2018-05-18T19:38:56Z
dc.date.issued2018-05-18
dc.date.submitted2018-05-16
dc.description.abstractIn this thesis, we study the capacitated generalization of the Matroid Median Problem which is a generalization of the classical clustering problem called the k-Median problem. In the capacitated matroid median problem, we are given a set F of facilities, a set D of clients and a common metric defined on F ∪ D, where the cost of connecting client j to facility i is denoted as c_{ij}. Each client j ∈ D has a demand of d_j, and each facility i ∈ F has an opening cost of f_i and a capacity u_i which limits the amount of demand that can be assigned to facility i. Moreover, there is a matroid M = (F,I) defined on the set of facilities. A solution to the capacitated matroid median problem involves opening a set of facilities F' ⊆ F such that F' ∈ I, and figuring out an assignment i(j) ∈ F' for every j ∈ D such that each facility i ∈ F' is assigned at most u_i demand. The cost associated with such a solution is : Σ_{i∈F} f_i + Σ_{j∈D} d_j c_{i(j)j}. Our goal is to find a solution of minimum cost. As the Matroid Median Problem generalizes the classical NP-Hard problem called k- median, it also is NP-Hard. We provide a bi-criteria approximation algorithm for the capacitated Matroid Median Problem with uniform capacities based on rounding the natural LP for the problem. Our algorithm achieves an approximation guarantee of 76 and violates the capacities by a factor of at most 6. We complement this result by providing two integrality gap results for the natural LP for capacitated matroid median.en
dc.identifier.urihttp://hdl.handle.net/10012/13331
dc.language.isoenen
dc.pendingfalse
dc.publisherUniversity of Waterlooen
dc.subjectApproximation algorithmsen
dc.subjectMatroid medianen
dc.subjectk-medianen
dc.subjectfacility locationen
dc.subjectclusteringen
dc.titleThe Capacitated Matroid Median Problemen
dc.typeMaster Thesisen
uws-etd.degreeMaster of Mathematicsen
uws-etd.degree.departmentCombinatorics and Optimizationen
uws-etd.degree.disciplineCombinatorics and Optimizationen
uws-etd.degree.grantorUniversity of Waterlooen
uws.contributor.advisorSwamy, Chaitanya
uws.contributor.affiliation1Faculty of Mathematicsen
uws.peerReviewStatusUnrevieweden
uws.published.cityWaterlooen
uws.published.countryCanadaen
uws.published.provinceOntarioen
uws.scholarLevelGraduateen
uws.typeOfResourceTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Kalhan_Sanchit.pdf
Size:
385.76 KB
Format:
Adobe Portable Document Format
Description:
Masters thesis pdf file
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
6.08 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Theses
Combinatorics and Optimization