Affiliation:
1. Technion Israel Institute of Technology Faculty of Computer Science
2. Technion, Computer Science
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 that is at most
O
(1). For a constant ϵ, this implies a constant approximation in
O
(log Δ/log log Δ) rounds, which contradicts the lower bound of [KMW10].
Funder
Israel Science Foundation
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献