This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
Search
Skip to Search Results
Filter
Author / Creator / Contributor
Subject / Keyword
- 1Algorithm
- 1Approximation
- 1Clustering
- 1balanced k median
- 1boounded treewidth graphs
- 1doubling dimension
Supervisors
Year
Collections
Languages
Item type
Departments
-
Spring 2023
In this thesis, we present Approximation Schemes for the Min Sum k Clustering problem on a number of classes of graph metrics. In Min Sum k Clustering problem introduced by Sahni and Gonzalez [22] in 1976, given a graph G(V, E) with metric edge costs and parameter k, we are asked to partition V...
1 - 1 of 1