Assertion: greedy algorithm | /r/CapableOf | give constant-factor approximations
Facets:
value: to optimization problems with submodular structure
type: OTHER
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.