Combinatorial Optimization Reading Group- Sharat ImbrahimpurExport this event to calendar

Friday, November 2, 2018 — 1:00 PM EDT

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.

Location 
MC - Mathematics & Computer Building
5479
200 University Avenue West

Waterloo, ON N2L 3G1
Canada

S M T W T F S
29
30
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
  1. 2019 (143)
    1. October (14)
    2. September (15)
    3. August (9)
    4. July (17)
    5. June (18)
    6. May (16)
    7. April (9)
    8. March (24)
    9. February (13)
    10. January (8)
  2. 2018 (138)
    1. December (2)
    2. November (18)
    3. October (14)
    4. September (9)
    5. August (2)
    6. July (10)
    7. June (13)
    8. May (17)
    9. April (9)
    10. March (19)
    11. February (14)
    12. January (11)
  3. 2017 (103)
  4. 2016 (137)
  5. 2015 (136)
  6. 2014 (88)
  7. 2013 (48)
  8. 2012 (39)
  9. 2011 (36)
  10. 2010 (40)
  11. 2009 (40)
  12. 2008 (39)
  13. 2007 (15)