The virtual private network problem (VPN) models scenarios in which traffic is uncertain or rapidly changing. The goal is supporting at minimum cost a given family of traffic matrices, which are implicitly given by upper bounds on the ingoing and outgoing traffic at each node. Costs are classically defined by a linear function (linear VPN), but we consider here also the more general case of concave increasing costs (concave VPN).In this paper we give the first constant factor approximation for concave VPN, and we improve the best‐known approximation factor for linear VPN. Our approximation results build on a novel reduction, based on König's theorem, which allows us to turn uncertainty of traffic into nonlinearity of the objective function. This way, we are able to reduce linear VPN and concave VPN to the single‐sink rent‐or‐buy problem (SROB) and the single‐sink buy‐at‐bulk problem (SSBB), respectively. Using the machinery developed for the latter two problems plus additional ideas, we are able to improve the approximation ratio for VPN.Along the way we also obtain, among other results, an improved approximation algorithm for SSBB and a tighter bound on the gap between the costs of arbitrary solutions and tree solutions for VPN. Furthermore, solving an open problem, we show that VPN remains NP‐hard even in the balanced case, where the sum of ingoing and outgoing traffic bounds is equal.
