2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/229081We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxiliary information besides port numbering is required.6 pages, 1 figureDistributed, Parallel, and Cluster Computingtext