- Tytuł:
- Matroids And Greedy Algorithms. A Deeper Justification of Using Greedy Approach To Find A Maximal set of a Matroid
- Autorzy:
- Haider, S. A.
- Powiązania:
- https://bibliotekanauki.pl/articles/106280.pdf
- Data publikacji:
- 2016
- Wydawca:
- Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
- Tematy:
-
contraction
greedy
independence Matroid
maximal - Opis:
- Greedy algorithms are used in solving a diverse set of problems in small computation time. However, for solving problems using greedy approach, it must be proved that the greedy strategy applies. The greedy approach relies on selection of optimal choice at a local level reducing the problem to a single sub problem, which actually leads to a globally optimal solution. Finding a maximal set from the independent set of a matroid M(S, I) also uses greedy approach and justification is also provided in standard literature (e.g. Introduction to Algorithms by Cormen et .al.). However, the justification does not clearly explain the equivalence of using greedy algorithm and contraction of M by the selected element. This paper thus attempts to give a lucid explanation of the fact that the greedy algorithm is equivalent to reducing the Matroid into its contraction by selected element. This approach also provides motivation for research on the selection of the test used in algorithm which might lead to smaller computation time of the algorithm.
- Źródło:
-
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2016, 16, 2; 48-50
1732-1360
2083-3628 - Pojawia się w:
- Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
- Dostawca treści:
- Biblioteka Nauki
Artykuł