In this paper,we consider the balanced Max-3-Uncut problem which has sev-eral applications in the design of VLSI circuits.We propose a complex discrete linear program for the balanced Max-3-Uncut problem.Applying the complex semidefinite programming rounding technique,we present a 0:3456-approximation algorithm by further integrating a greedy swapping process after the rounding step.