Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Lower-bounded clustering"”.

  1. Approximation Algorithms for Clustering and Facility Location Problems

    … abstraction is quite versatile and also captures clustering problems, where one typically seeks to partition a set of data points into k clusters, for some given k, in a suitable way, which themselves find applications in data mining, machine learning, and bioinformatics. Basic variants of …

    waterloo Repository record for Approximation Algorithms for Clustering and Facility Location Problems (opens in a new tab)