Wednesday, 16:15 - 16:40 h, Room: H 3010


Aravind Srinivasan
Dependent rounding and its applications


Randomized rounding is a well-known and powerful tool in rounding solutions to relaxations of optimization problems. Starting with the work of Ageev and Sviridenko, the notion of dependent randomized rounding has led to significant progress in a variety of (approximation) algorithms: one carefully defines dependencies between several basic random variables in the rounding process. We will present a brief survey of this area, including works of the speaker and those of Calinescu, Chekuri, Pal and Vondrak.


Talk 3 of the invited session Wed.3.H 3010
"Randomized rounding algorithms in mathematical programming" [...]
Cluster 1
"Approximation & online algorithms" [...]


  The best way to go for you to know the credible Michigan Payday Loans providers. If you have already decided to take Buy Generic Levitra, be sure to consult a doctor, you don't have any contraindications and act strictly due to a prescription.