Minimizing a monotone concave function with laminar covering constraints

https://doi.org/10.1016/j.dam.2007.04.016Get rights and content
Under an Elsevier user license
open archive

Abstract

Let V be a finite set with |V|=n. A family F2V is called laminar if for all two sets X,YF, XY implies XY or XY. Given a laminar family F, a demand function d:FR+, and a monotone concave cost function F:R+VR+, we consider the problem of finding a minimum-cost xR+V such that x(X)d(X) for all XF. Here we do not assume that the cost function F is differentiable or even continuous. We show that the problem can be solved in O(n2q) time if F can be decomposed into monotone concave functions by the partition of V that is induced by the laminar family F, where q is the time required for the computation of F(x) for any xR+V. We also prove that if F is given by an oracle, then it takes Ω(n2q) time to solve the problem, which implies that our O(n2q) time algorithm is optimal in this case. Furthermore, we propose an O(nlog2n) algorithm if F is the sum of linear cost functions with fixed setup costs. These also make improvements in complexity results for source location and edge-connectivity augmentation problems in undirected networks. Finally, we show that in general our problem requires Ω(2n/2q) time when F is given implicitly by an oracle, and that it is NP-hard if F is given explicitly in a functional form.

Keywords

Laminar cover
Source location
Edge-connectivity augmentation

Cited by (0)

An extended abstract of this paper appeared in Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), China, December 2005 [16].