What are the problems with the best approximation ratio achieved by algorithm returning uniformly random solution?
For constraint satisfaction problems, the property of having no better approximation algorithm than random assignment is known as approximation resistance.

This is has been studied by several works in the last few years, with some results based on $P\neq NP$ and other more general results based on the unique games conjecture. A good source for this is Per Austrin's thesis.