A simple local 3-approximation algorithm for vertex cover
Valentin Polishchuk, Jukka Suomela
TL;DR
This paper introduces a deterministic, local, constant-time distributed algorithm that efficiently finds a vertex cover within three times the optimal size in graphs with bounded degree, requiring minimal information.
Contribution
It presents a simple, deterministic local algorithm for 3-approximate vertex cover in bounded-degree graphs, requiring only port numbering and no additional data.
Findings
Achieves a 3-approximation in constant time
Operates with minimal information, only port numbering
Applicable to bounded-degree graphs
Abstract
We 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.