We consider the problem of finding an orientation with minimum diameter of a
connected bridgeless graph. Fomin et. al. discovered a relation between the
minimum oriented diameter an the size of a minimal dominating set. We improve
their upper bound.Comment: 21 pages, 6 figure
