research-article

A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds

Authors:

Reuven Bar-Yehuda,

Keren Censor-Hillel,

Gregory SchwartzmanAuthors Info & Claims

PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing

Pages 3 - 8

https://doi.org/10.1145/2933057.2933086

Published: 25 July 2016 Publication History

Abstract

We present a simple deterministic distributed (2+ε) approximation algorithm for minimum weight vertex cover, which completes in O(logδ/εlog logδ) rounds, where δ is the maximum degree in the graph, for any ε > 0 which is at most O(1). For a constant ε, this implies a constant approximation in Ologδ/log log δ) rounds, which contradicts the lower bound of [KMW10].

References

[1]

Matti Åstrand, Patrik Floréen, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, and Jara Uitto. A local 2-approximation algorithm for the vertex cover problem. In Distributed Computing, 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009. Proceedings, pages 191--205, 2009.

Digital Library

[2]

Matti Åstrand and Jukka Suomela. Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. In SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15, 2010, pages 294--302, 2010.

Digital Library

[3]

Reuven Bar-Yehuda. One for the price of two: a unified approach for approximating covering problems. Algorithmica, 27(2):131--144, 2000.

[4]

Reuven Bar-Yehuda and Shimon Even. A linear-time approximation algorithm for the weighted vertex cover problem. J. Algorithms, 2(2):198--203, 1981.

[5]

Leonid Barenboim, Michael Elkin, Seth Pettie, and Johannes Schneider. The locality of distributed symmetry breaking. In 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012, pages 321--330, 2012.

Digital Library

[6]

Reuven Bar-Yehuda and Dror Rawitz. On the equivalence between the primal-dual schema and the local ratio technique. SIAM J. Discrete Math., 19(3):762--797, 2005.

Digital Library

[7]

Reuven Bar-Yehuda and Shimon Even. A local-ratio theorem for approximating the weighted vertex cover problem. North-Holland Mathematics Studies, 109:27--45, 1985.

[8]

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Third Edition. The MIT Press, 3rd edition, 2009.

Digital Library

[9]

M. R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.

Digital Library

[10]

Fabrizio Grandoni, Jochen Könemann, and Alessandro Panconesi. Distributed weighted vertex cover via maximal matchings. ACM Transactions on Algorithms, 5(1), 2008.

Digital Library

[11]

Fabrizio Grandoni, Jochen Könemann, Alessandro Panconesi, and Mauro Sozio. A primal-dual bicriteria distributed algorithm for capacitated vertex cover. SIAM J. Comput., 38(3):825--840, 2008.

Digital Library

[12]

Michal Hanckowiak, Michal Karonski, and Alessandro Panconesi. On the distributed complexity of computing maximal matchings. SIAM J. Discrete Math., 15(1):41--57, 2001.

Digital Library

[13]

Dorit S. Hochbaum. Approximation algorithms for the set covering and vertex cover problems. SIAM J. Comput., 11(3):555--556, 1982.

Digital Library

[14]

Richard M. Karp. Reducibility among combinatorial problems. In Proceedings of a symposium on the Complexity of Computer Computations, held March 20-22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York., pages 85--103, 1972.

[15]

Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. What cannot be computed locally! In Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, July 25-28, 2004, pages 300--309, 2004.

Digital Library

[16]

Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. The price of being near-sighted. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pages 980--989, 2006.

Digital Library

[17]

Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. Local computation: Lower and upper bounds. CoRR, abs/1011.5470, 2010.

[18]

Subhash Khot and Oded Regev. Vertex cover might be hard to approximate to within 2-epsilon. J. Comput. Syst. Sci., 74(3):335--349, 2008.

Digital Library

[19]

Samir Khuller, Uzi Vishkin, and Neal E. Young. A primal-dual parallel approximation technique applied to weighted set and vertex covers. J. Algorithms, 17(2):280--289, 1994.

Digital Library

[20]

Christos Koufogiannakis and Neal E. Young. Distributed algorithms for covering, packing and maximum weighted matching. Distributed Computing, 24(1):45--63, 2011.

Digital Library

[21]

George L. Nemhauser and Leslie E. Trotter Jr. Vertex packings: Structural properties and algorithms. Math. Program., 8(1):232--248, 1975.

Digital Library

[22]

Seth Pettie. Personal communication. 2016.

[23]

Alessandro Panconesi and Romeo Rizzi. Some simple distributed algorithms for sparse networks. Distributed Computing, 14(2):97--100, 2001.

Digital Library

[24]

Boaz Patt-Shamir, Dror Rawitz, and Gabriel Scalosub. Distributed approximation of cellular coverage. J. Parallel Distrib. Comput., 72(3):402--408, 2012.

Digital Library

[25]

Valentin Polishchuk and Jukka Suomela. A simple local 3-approximation algorithm for vertex cover. Inf. Process. Lett., 109(12):642--645, 2009.

Digital Library

Cited By

Akhoondian Amiri SWiederhake B(2022)Distributed distance-r covering problems on sparse high-girth graphsTheoretical Computer Science10.1016/j.tcs.2022.01.001Online publication date: Jan-2022
https://doi.org/10.1016/j.tcs.2022.01.001
Ben-Basat REven GKawarabayashi KSchwartzman G(2021)Optimal distributed covering algorithmsDistributed Computing10.1007/s00446-021-00391-w36:1(45-55)Online publication date: 11-Apr-2021
https://doi.org/10.1007/s00446-021-00391-w
Akhoondian Amiri SWiederhake B(2021)Distributed Distance-r Covering Problems on Sparse High-Girth GraphsAlgorithms and Complexity10.1007/978-3-030-75242-2_3(37-60)Online publication date: 4-May-2021
https://doi.org/10.1007/978-3-030-75242-2_3
Show More Cited By

Index Terms

A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds
1. Networks
  1. Network algorithms
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Packing and covering problems
    2. Distributed algorithms

Recommendations

A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds

We present a simple deterministic distributed (2 + ϵ)-approximation algorithm for minimum-weight vertex cover, which completes in O(log Δ/ϵlog log Δ) rounds, where Δ is the maximum degree in the graph, for any ϵ > 0 that is at most O(1). For a constant ...
Improved Distributed Delta-Coloring
PODC '18: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing

We present a randomized distributed algorithm that computes a Δ- coloring in any non-complete graph with maximum degree Δ ≥ 4 in O(log Δ) +2O( √ log log n) rounds, as well as a randomized algorithm that computes a Δ-coloring in O((log logn)2) rounds ...
No sublogarithmic-time approximation scheme for bipartite vertex cover

König's theorem states that on bipartite graphs the size of a maximum matching equals the size of a minimum vertex cover. It is known from prior work that for every $$\epsilon > 0$$ ∈ > 0 there exists a constant-time distributed algorithm that finds a $$(1+\epsilon )$$ ( 1 + ∈ ) -approximation of a ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing

July 2016

508 pages

ISBN:9781450339643

DOI:10.1145/2933057

General Chair:
George Giakkoupis
INRIA, France

Copyright © 2016 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 July 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Badges

Best Student Paper

Author Tags

Qualifiers

Research-article

Funding Sources

Israel Science Foundation

Conference

PODC '16

Sponsor:

PODC '16: ACM Symposium on Principles of Distributed Computing

July 25 - 28, 2016

Illinois, Chicago, USA

Acceptance Rates

PODC '16 Paper Acceptance Rate 40 of 149 submissions, 27%;

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
391
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Akhoondian Amiri SWiederhake B(2022)Distributed distance-r covering problems on sparse high-girth graphsTheoretical Computer Science10.1016/j.tcs.2022.01.001Online publication date: Jan-2022
https://doi.org/10.1016/j.tcs.2022.01.001
Ben-Basat REven GKawarabayashi KSchwartzman G(2021)Optimal distributed covering algorithmsDistributed Computing10.1007/s00446-021-00391-w36:1(45-55)Online publication date: 11-Apr-2021
https://doi.org/10.1007/s00446-021-00391-w
Akhoondian Amiri SWiederhake B(2021)Distributed Distance-r Covering Problems on Sparse High-Girth GraphsAlgorithms and Complexity10.1007/978-3-030-75242-2_3(37-60)Online publication date: 4-May-2021
https://doi.org/10.1007/978-3-030-75242-2_3
Ben Basat REven GKawarabayashi KSchwartzman GRobinson PEllen F(2019)Optimal Distributed Covering AlgorithmsProceedings of the 2019 ACM Symposium on Principles of Distributed Computing10.1145/3293611.3331577(104-106)Online publication date: 16-Jul-2019
https://dl.acm.org/doi/10.1145/3293611.3331577
Bar-Yehuda RCensor-Hillel KGhaffari MSchwartzman GSchiller ESchwarzmann A(2017)Distributed Approximation of Maximum Independent Set and Maximum MatchingProceedings of the ACM Symposium on Principles of Distributed Computing10.1145/3087801.3087806(165-174)Online publication date: 25-Jul-2017
https://dl.acm.org/doi/10.1145/3087801.3087806
Censor-Hillel KLevy RShachnai H(2017)Fast Distributed Approximation for Max-CutAlgorithms for Sensor Systems10.1007/978-3-319-72751-6_4(41-56)Online publication date: 31-Dec-2017
https://doi.org/10.1007/978-3-319-72751-6_4
Chang YKopelowitz TPettie SGiakkoupis G(2016)Brief AnnouncementProceedings of the 2016 ACM Symposium on Principles of Distributed Computing10.1145/2933057.2933079(195-197)Online publication date: 25-Jul-2016
https://dl.acm.org/doi/10.1145/2933057.2933079
Barenboim LElkin MPettie SSchneider J(2016)The Locality of Distributed Symmetry BreakingJournal of the ACM10.1145/290313763:3(1-45)Online publication date: 28-Jun-2016
https://doi.org/10.1145/2903137
Kuhn FMoscibroda TWattenhofer R(2016)Local ComputationJournal of the ACM10.1145/274201263:2(1-44)Online publication date: 31-Mar-2016
https://doi.org/10.1145/2742012
Chang YKopelowitz TPettie S(2016)An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS.2016.72(615-624)Online publication date: Oct-2016
https://doi.org/10.1109/FOCS.2016.72

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents