Complexity question regarding randomized approximation algorithm

From: Edmond (edmond333_at_gmail.com)
Date: 10/21/04 

Date: 21 Oct 2004 14:30:26 -0700

Are there any complexity-related results on randomized approximation
algorithms?

More specifically, if I have a deterministic approximation lower
bound, say O(log n), on an optimization problem, can we say something
about the lower bound for randomized approximation algorithms on the
same problem?

Thanks,
Edmond