Edge-connectivity augmentation problems
Journal of Computer and System Sciences
Augmenting graphs to meet edge-connectivity requirements
SIAM Journal on Discrete Mathematics
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A Fast Algorithm for Optimally Increasing the Edge Connectivity
SIAM Journal on Computing
A note on minimizing submodular functions
Information Processing Letters
Augmenting edge-connectivity over the entire range in Õ(nm) time
Journal of Algorithms
Augmenting undirected edge connectivity in Õ(n2) time
Journal of Algorithms
Locating sources to meet flow demands in undirected networks
Journal of Algorithms
Minimizing a monotone concave function with laminar covering constraints
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximating minimum cost source location problems with local vertex-connectivity demands
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Approximating minimum cost source location problems with local vertex-connectivity demands
Journal of Discrete Algorithms
Hi-index | 0.04 |
Let V be a finite set with |V|=n. A family F@?2^V is called laminar if for all two sets X,Y@?F, X@?Y@A implies X@?Y or X@?Y. Given a laminar family F, a demand function d:F-R"+, and a monotone concave cost function F:R"+^V-R"+, we consider the problem of finding a minimum-cost x@?R"+^V such that x(X)=d(X) for all X@?F. 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(n^2q) 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 x@?R"+^V. We also prove that if F is given by an oracle, then it takes @W(n^2q) time to solve the problem, which implies that our O(n^2q) time algorithm is optimal in this case. Furthermore, we propose an O(nlog^2n) 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 @W(2^n^/^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.