Recent Advances in Approximation Algorithms
(A post-FST&TCS 2006 Workshop)
Kolkata, India
December 16, 2006
The workshop will focus on recent developments in the theory of approximation algorithms.
Tentative Schedule
8:30-9:10 David Shmoys : Approximation Algorithms for Stochastic Inventory Control Models
9:15:10:00 Sudipto Guha : Optimization under Probes and Partial Information
10:00-10:15 : Break
10:15-10:55 Venkat Guruswami : Inapproximability results for learning with noise
11:00-11:40 : Nisheeth Vishnoi : A Semidefinite Programming Based Approach for Partitioning Graphs
11:40-1:30 : Lunch break
1:30-2:10 Yuval Rabani : TBA
2:15-2:55 Alberto Marchetti Spaccamela: Data aggregation in sensor networks: an algorithmic perspective
2:55-3:10 : break
3:10-3:50 Kunal Talwar : Approximating degree bounded spanning trees
3:55-4:35 Fabrizio Grandoni: Improved Approximation for Connected Facility Location
Our Speakers
- Fabrizio Grandoni, University of Rome (La Sapienza)
- Sudipto Guha, UPenn
- Venkat Guruswami, University of Washington
- Alberto Marchetti Spaccamela, University of Rome (La Sapienza)
- Yuval Rabani, Technion (Haifa)
- David Shmoys, Cornell University
- Kunal Talwar, Microsoft Research
- Nisheeth Vishnoi, IBM India
Organizers:
- Amit Kumar, IIT Delhi
- Anupam Gupta, Carnegie Mellon University
Last Updated: December 12, 2006