New performance guarantees for the greedy maximization of submodular set functions

Research output: Contribution to journalArticleScientificpeer-review

Original languageEnglish
JournalOptimization Letters
Volume11
Issue number4
Pages (from-to)655-665
Number of pages11
ISSN1862-4472
DOIs
Publication statusPublished - Apr 2017
MoE publication typeA1 Journal article-refereed

Fields of Science

  • Approximation
  • Cardinality
  • Convex optimization
  • Greedy algorithm
  • Maximization
  • Steepest ascent
  • RESERVE SELECTION
  • FUNCTION SUBJECT
  • ALGORITHM
  • APPROXIMATIONS
  • CONSTRAINT
  • 111 Mathematics

Cite this