061412e4a03c02f9902576ec55ebbe77-AuthorFeedback.pdf

Reviewer #1 Q. Parameterizing the running time with the size of a feasible solution is not very common. This algorithm is not useful in only the matroid case. Moreover, there is no guarantee in the22 only knapsack case. We should point out that the power of our algorithm is in solving the monotone submodular23 maximization problem subjecttotheintersection ofthesetwoconstraints. We believe the problem of maximizing a27 submodular function subject to the interaction ofk-matroids and`-knapsack constraints has both theoretical and28 practical importance.