Approximation algorithms for utility-maximizing network design problem

Abstract

In this paper we consider the problem of selecting a collection of source-destination paths in a capacitated network in order to maximize the sum of concave utility functions. We show that the problem is NP-complete even for the iso-elastic utility functions. We provide deterministic and randomized algorithms that enable us to compute approximate solutions. We conclude the paper with results of computational experiments on example datasets. © Springer International Publishing Switzerland 2015.