Matroids And Greedy Algorithms. A Deeper Justification of Using Greedy Approach To Find A Maximal set of a Matroid

Syed Aqib Haider. Matroids And Greedy Algorithms. A Deeper Justification of Using Greedy Approach To Find A Maximal set of a Matroid. Annales UMCS, Informatica, 16(2):48, 2017. [doi]

@article{Haider17-0,
  title = {Matroids And Greedy Algorithms. A Deeper Justification of Using Greedy Approach To Find A Maximal set of a Matroid},
  author = {Syed Aqib Haider},
  year = {2017},
  doi = {10.17951/ai.2016.16.2.48},
  url = {https://doi.org/10.17951/ai.2016.16.2.48},
  researchr = {https://researchr.org/publication/Haider17-0},
  cites = {0},
  citedby = {0},
  journal = {Annales UMCS, Informatica},
  volume = {16},
  number = {2},
  pages = {48},
}