139 research outputs found
Density Functions subject to a Co-Matroid Constraint
In this paper we consider the problem of finding the {\em densest} subset
subject to {\em co-matroid constraints}. We are given a {\em monotone
supermodular} set function defined over a universe , and the density of
a subset is defined to be f(S)/\crd{S}. This generalizes the concept of
graph density. Co-matroid constraints are the following: given matroid \calM
a set is feasible, iff the complement of is {\em independent} in the
matroid. Under such constraints, the problem becomes \np-hard. The specific
case of graph density has been considered in literature under specific
co-matroid constraints, for example, the cardinality matroid and the partition
matroid. We show a 2-approximation for finding the densest subset subject to
co-matroid constraints. Thus, for instance, we improve the approximation
guarantees for the result for partition matroids in the literature
Bounding the Greedy Strategy in Finite-Horizon String Optimization
We consider an optimization problem where the decision variable is a string
of bounded length. For some time there has been an interest in bounding the
performance of the greedy strategy for this problem. Here, we provide weakened
sufficient conditions for the greedy strategy to be bounded by a factor of
, where is the optimization horizon length. Specifically, we
introduce the notions of -submodularity and -GO-concavity, which together
are sufficient for this bound to hold. By introducing a notion of
\emph{curvature} , we prove an even tighter bound with the factor
. Finally, we illustrate the strength of our results by
considering two example applications. We show that our results provide weaker
conditions on parameter values in these applications than in previous results.Comment: This paper has been accepted by 2015 IEEE CD
- …