Approximation Algorithms

What is the best polynomial-time approximation ratio achievable for Max Di-Cut? Max Di-Cut is the directed graph version of Max Cut: given a directed graph, find a partition of vertices maximizing ...