Valentin Polishchuk · Jukka Suomela

A simple local 3-approximation algorithm for vertex cover

Information Processing Letters · volume 109, issue 12, pages 642–645, May 2009 · doi:10.1016/j.ipl.2009.02.017

authors’ version publisher’s version arXiv.org

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.

Links

© Elsevier 2009

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author’s copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.