What is the definition of an "orthogonal greedy algorithm"?
What is the definition of a "relaxed greedy algorithms"?
Can you give an example to illustrate how these notions differ from ordinary greedy algorithms?
There are a few variations to the greedy algorithm:
- Pure greedy algorithms
- Orthogonal greedy algorithms
- Relaxed greedy algorithms
Wikipedia does not explain further or provide any examples, so it's not clear what the Wikipedia article is referring to.