Friday, October 19, 2018

Friday, October 19, 2018 — 1:00 PM EDT

Title: Primal-dual and Lagrangian relaxation techniques for k-median

Speaker: Madison Van Dyk Affiliation: University of Waterloo Room:  MC 5479

Abstract: We will develop primal-dual algorithms to obtain constant-factor approximations for the uncapacitated facility location problem.

Friday, October 19, 2018 — 3:30 PM EDT

Title: New algorithms for maximum disjoint paths based on tree-likeness

Speaker: Matthias Mnich Affiliation: University of Bonn Room: MC 5501

Abstract:

We study the classical NP-hard problems of finding maximum-size subsets from given sets of k terminal pairs that can be routed via edge-disjoint paths (MaxEDP) or node-disjoint paths (MaxNDP) in a given graph.

S M T W T F S
26
27
28
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
3
4
5
6
  1. 2022 (146)
    1. December (4)
    2. November (18)
    3. October (15)
    4. September (11)
    5. August (2)
    6. July (17)
    7. June (17)
    8. May (10)
    9. April (12)
    10. March (18)
    11. February (10)
    12. January (13)
  2. 2021 (103)
    1. December (3)
    2. November (7)
    3. October (6)
    4. September (12)
    5. August (6)
    6. July (10)
    7. June (12)
    8. May (7)
    9. April (9)
    10. March (13)
    11. February (8)
    12. January (10)
  3. 2020 (119)
  4. 2019 (167)
  5. 2018 (136)
    1. December (2)
    2. November (18)
    3. October (14)
    4. September (7)
    5. August (2)
    6. July (10)
    7. June (13)
    8. May (17)
    9. April (9)
    10. March (19)
    11. February (14)
    12. January (11)
  6. 2017 (103)
  7. 2016 (137)
  8. 2015 (136)
  9. 2014 (88)
  10. 2013 (48)
  11. 2012 (39)
  12. 2011 (36)
  13. 2010 (40)
  14. 2009 (40)
  15. 2008 (39)
  16. 2007 (15)