  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
$(1-(1-1/K)^K)$, where $K$ is the optimization horizon length. Specifically, we
introduce the notions of $K$-submodularity and $K$-GO-concavity, which together
are sufficient for this bound to hold. By introducing a notion of
\emph{curvature} $\eta\in(0,1]$, we prove an even tighter bound with the factor
$(1/\eta)(1-e^{-\eta})$. 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.
