Assertion: greedy algorithm | /r/CapableOf | solve combinatorial problems
Facets:
value: in mathematical optimization
type: OTHER
value: optimally
type: MANNER
Source sentences:
text: In mathematical optimization, greedy algorithms optimally solve combinatorial problems having the properties of matroids, and give constant-factor approximations to optimization problems with submodular structure.