Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
Title: Approximating k-Median via Pseudo-Approximation
Speaker: | Sharat Ibrahimpur |
Affiliation: | University of Waterloo |
Room: | MC 5479 |
Abstract: In the last two talks we saw two approaches for approximating k-median. The first approach was to use primal-dual method to approximate uncapacitated facility location and then extend this algorithm, at a loss of factor of 2, to k-median in a blackbox fashion by using the Lagrangian relaxation technique. In the second approach we saw that local search with p swaps gives a 3+2/p-approximation. For more than a decade beating the 3-approximation guarantee for k-median was considered an important open problem. In this talk I will present a 2.74-approximation algorithm for k-median based on the work of Shi Li and Ola Svensson by the same title.
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
The University of Waterloo acknowledges that much of our work takes place on the traditional territory of the Neutral, Anishinaabeg and Haudenosaunee peoples. Our main campus is situated on the Haldimand Tract, the land granted to the Six Nations that includes six miles on each side of the Grand River. Our active work toward reconciliation takes place across our campuses through research, learning, teaching, and community building, and is co-ordinated within the Office of Indigenous Relations.