"A succinct and approximate greedy algorithm for the Minimum Set Cover Problem."

Jorge Delgado, Héctor Ferrada, Cristóbal A. Navarro (2024)

> Home

Details and statistics

DOI: 10.1016/J.JOCS.2024.102378

access: closed

type: Journal Article

metadata version: 2024-08-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jocs/DelgadoFN24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jocs/DelgadoFN24
Jorge Delgado, Héctor Ferrada, Cristóbal A. Navarro:
A succinct and approximate greedy algorithm for the Minimum Set Cover Problem. J. Comput. Sci. 81: 102378 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.