Diameter of orientations of graphs with given minimum degree

We show that every bridgeless graph of order n and minimum degree δ has a strongly connected orientation of diameter at most 11δ+1n+9, and such an orientation can be found in polynomial time.