Greedy algorithms: a review and open problems
Abstract Greedy algorithms are a fundamental class of mathematics and computer science algorithms, defined by their iterative approach of making locally optimal decisions to approximate global optima. In this review, we focus on two greedy algorithms. First, we examine the relaxed greedy algorithm i...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2025-02-01
|
| Series: | Journal of Inequalities and Applications |
| Subjects: | |
| Online Access: | https://doi.org/10.1186/s13660-025-03254-1 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|