Tuesday, July 23, 2013 — 3:30 PM to 4:30 PM EDT

Faster resource Sharing and VLSI Routing

Speaker: Jens Vygen
Affiliation: University of Bonn
Room: Mathematics and Computer Building (MC) 5158

Abstract:

We present a faster algorithm for the min-max resource sharing problem, generalizing the Garg-Könemann algorithm, and improving previous results by Grigoriadis and Khachiyan, Khandekar, and Jansen and Zhang.

We also show how this algorithm can be implemented efficiently and used to solve challenging global routing problems in chip design.
We obtain a near-optimal packing of millions of Steiner trees within a few hours.

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

Waterloo, ON N2L 3G1
Canada

S M T W T F S
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
  1. 2022 (70)
    1. June (2)
    2. May (16)
    3. April (12)
    4. March (18)
    5. February (10)
    6. 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)
  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)