An Approximate Solution to the Minimum Vertex Cover Problem: The Salvador Algorithm

Frank Vega

Open source

DOI
10.20944/preprints202605.2000.v8
Published
2026-10-20
Container
Not recorded
Publisher
MDPI AG
Open access
unknown

Credibility signals

uncertain Score 60/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.20944/preprints202605.2000.v8,
  title = {An Approximate Solution to the Minimum Vertex Cover Problem: The Salvador Algorithm},
  author = {Frank Vega},
  year = {2026},
  doi = {10.20944/preprints202605.2000.v8},
  url = {https://doi.org/10.20944/preprints202605.2000.v8}
}

RIS

TY  - JOUR
TI  - An Approximate Solution to the Minimum Vertex Cover Problem: The Salvador Algorithm
AU  - Frank Vega
PY  - 2026
DO  - 10.20944/preprints202605.2000.v8
UR  - https://doi.org/10.20944/preprints202605.2000.v8
ER  - 

APA

Vega, F. (2026). An Approximate Solution to the Minimum Vertex Cover Problem: The Salvador Algorithm. https://doi.org/10.20944/preprints202605.2000.v8

Source records