We treat the text summarization problem as maximizing a submodular function under a budget constraint.
We show, both theoretically and empirically, a modiﬁed greedy algorithm can efﬁciently solve the budgeted submodular maximization problem near-optimally, and we derive new approximation bounds in do ing so.
Experiments on DUC’04 task show that our approach is superior to the best performing method from the DUC’04 evaluation on ROUGE-1 scores.
