Refine
Year of publication
- 2013 (1)
Document Type
- Preprint (1)
Language
- English (1)
Has Fulltext
- yes (1)
Keywords
- Greedy algorithm (1) (remove)
Faculty / Organisational entity
It is well known that the greedy algorithm solves matroid base problems for all linear cost functions and is, in fact, correct if and only if the underlying combinatorial structure of the problem is a matroid. Moreover, the algorithm can be applied to problems with sum, bottleneck, algebraic sum or \(k\)-sum objective functions.