[Lowerbounds, Upperbounds]

Algorithms are everywhere.

From arXiv’s cs daily comes a theory paper that can be used to deal with matters of life and death. How could theory be any more practical than *that*? :P

The intuition here is that it is saying: “Regarding membership in L, if you put a gun to my head and forced me to bet on one of x or y as belonging to L, my money would be on f(x,y).”

Full information:
Read the rest of this entry »

Kedar Dhamdhere
Computer Science Department

Date: Friday, June 24, 2005
Time: 2 pm
Place: Wean 4623
Title: Approximation Algorithms for Metric Embedding Problems

Abstract:
Read the rest of this entry »

Matteo Fischetti
Department of Information Engineering, University of Padova

Friday, July 1, 2005
2:00 – 3:30 pm
388 Posner Hall

Mixed-Integer Cuts from Cyclic Groups: a Computational Study

Abstract:
Read the rest of this entry »