Minimum strongly biconnected spanning directed subgraph problem

Let $G=(V,E)$ be a strongly biconnected directed graph. In this paper we consider the problem of computing an edge subset $H\subseteq E$ of minimum size such that the directed subgraph $(V,H)$ is strongly biconnected.