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 “"Approximation Algorithm, Clustering, Facility Location, Submodular function"”.

  1. Approximation algorithms for clustering and facility location problems

    In this thesis we design and analyze algorithms for various facility location and clustering problems. The problems we study are NP-Hard and therefore, assuming P is not equal NP, there do not exist polynomial time algorithms to solve them optimally. One approach to cope with the intractability of …

    uiuc Repository record for Approximation algorithms for clustering and facility location problems (opens in a new tab)