A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Minimizing a monotone concave function with laminar covering constraints
2008
Discrete Applied Mathematics
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 = ∅ 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 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 2 q) time if F can be decomposed into monotone concave functions by
doi:10.1016/j.dam.2007.04.016
fatcat:cxsflulerrdvfamvqvrvhlifcq