| |
Fall 2001-Spring 2002 Archive
|
|
|
| Date |
Speaker |
Location |
Sponsor |
| September
7 |
Jesus De Loera Dept.
of Mathematics, UC Irvine
The
Minimum Weight Triangulation Problem
|
GSIA 388
3:30 |
OR |
| September
21 |
Gerard Cornuejols
GSIA, CMU
Decomposition
of perfect graphs |
GSIA 343
3:30 |
OR |
| October
12 |
R. Ravi GSIA,
CMU
Approximation
algorithms for buy-at-bulk network design |
GSIA 145
3:30 |
OR |
| October
19 |
Mark Squillante
IBM Watson
On
Optimal Resource Scheduling Problems in e-Commerce Environments
|
TBA
3:30 |
OR
SCS |
| October
26 |
Michael Mitzenmacher
Dept. of Computer Science, Harvard University
|
TBA
3:30 |
SCS |
| November
2: |
John Hooker GSIA,
CMU
A
Continuous Relaxation of the Cumulative Constraint |
GSIA 145
3:30
|
OR |
| November
9: |
Tuomas Sandholm
CSD, CMU
Issues
in the Intersection of Mechanism Design and Complexity
|
TBA
3:30 |
SCS |
| November
16 |
Ileana Streinu
Smith College
New
and "Old" Results on
Pseudo-Triangulations |
TBA
3:30 |
OR |
| November
30 |
John Dunagan MIT
Perturbations
to Linear Programming
|
TBA
3:30 |
SCS |
| December
7 |
Egon Balas GSIA,
CMU
Convex
Hull Representation of Certain Unions of Polytopes
|
GSIA 145
3:30 |
SCS |
| December
12 |
Rocco
Servedio Harvard University |
TBA
3:30 |
SCS |
| December
14 |
Vijay
Vazirani Georgia Tech
The
Primal-Dual Schema and its Applications to Cooperative Games
|
GSIA 145 |
OR |
| January
25 |
Ramin Zabih
Dept. of Computer Science, Cornell University
Some
recent results on graph cuts in computer vision
|
|
SCS |
| February
1 |
Lisa
Fleischer Carnegie Mellon University
Survivable
network design: approximation algorithms via iterative rounding
|
GSIA 145
3:30 |
OR |
| February
18 |
Omer
Reingold AT&T Labs
The
Zigzag Graph Product and Constant-Degree Lossless Expanders
|
10:00AM,
NSH 3305 |
SCS |
| February
15 |
Mike
Trick Carnegie Mellon University
Constraint
Programming and Hybrid Formulations for Three Life Designs
|
GSIA 343
3:30 |
OR |
| February 22
|
Aravind
Srinivasan Dept of Computer Science, University of Maryland
Distributions
on Level-sets with Applications to Approximation Algorithms
|
|
SCS |
| February 22
|
Gerald
Thompson GSIA, Carnegie Mellon University
New
Results for Kirkman numbers and Their Generalizations |
GSIA 145
2:30 |
OR |
| March 1 |
William
Cook Dept. of Mathematics, Princeton University
Solving
Traveling Salesman Problems |
GSIA 145
2:30 |
|
| March 8 |
Jay Sethuraman
IEOR, Columbia University
An
Integer Programming approach to Social Choice |
GSIA 145
3:30 |
|
| March 14 |
Chris
Umans Microsoft research |
NSH 3305
10:30AM |
SCS |
| March 15 |
Chandra
Chekuri Lucent Technologies |
GSIA 145
3:30 |
OR |
| March 22 |
David
Williamson IBM Research, Almaden
An
application of complex semidefinite programming to approximation
algorithms |
GSIA 145
3:30 |
OR |
| March 28 |
Anupam
Gupta Bell Labs
|
10:30AM,
NSH 3305 |
SCS |
| March 29 |
Mike
Todd Operations Research and Indus. Eng., Cornell University
TBA |
GSIA 145
3:30 |
|
| April
5 |
Spring Break |
|
|
| April 12 |
Venkat
Guruswami Berkely
Linear
Time Encodable/Decodable Codes with Near-Optimal Rate
|
|
SCS |
| April 12 |
Ioana
Popescu INSEAD
Robust
Mean-Covariance Solutions for Stochastic Optimization Problems
and Applications
|
GSIA 152
1.00 |
OR |
| April 26 |
Adam
Meyerson Stanford
Online
Network Design |
|
SCS |
| May 3 |
Chandra
Chekuri Lucent Bell Labs
|
GSIA 145
3:30 |
OR |
| May 3 |
Reha
Tutuncu Math Dept, Carnegie Mellon University
|
GSIA 145
3:30 |
|
| |
 The
Joint ALADDIN/Theory/Operations Research Seminar
Archives
See also the Seminars
on Algorithms and Complexity page
|
CENTER
Carnegie
Mellon 
The Joint ALADDIN/Theory/Operations
Research Seminar 
Aladdin
