A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Removing randomness in parallel computation without a processor penalty
Journal of Computer and System Sciences
A primal-dual parallel approximation technique applied to weighted set and vertex covers
Journal of Algorithms
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Nearly optimal distributed edge coloring in O(log log n) rounds
Random Structures & Algorithms
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
SIAM Journal on Computing
Capacitated vertex covering with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
SIAM Journal on Computing
Dependent Rounding in Bipartite Graphs
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Covering Problems with Hard Capacities
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
An improved approximation algorithm for vertex cover with hard capacities
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Distributed approximation of capacitated dominating sets
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Efficient distributed approximation algorithms via probabilistic tree embeddings
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Distributed and parallel algorithms for weighted vertex cover and other covering problems
Proceedings of the 28th ACM symposium on Principles of distributed computing
Fast distributed algorithms via primal-dual
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
A distributed primal-dual heuristic for steiner problems in networks
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Dominating sets of agents in visibility graphs: distributed algorithms for art gallery problems
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
| Hi-index | 0.01 |
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G=(V,E), non-negative vertex weights wtv for all vertices v ∈ V, and node-capacities Bv ≥ 1 for all v ∈ V. A feasible solution to a given capVC instance consists of a vertex cover C ⊆ V. Each edge e ∈ E is assigned to one of its endpoints in C and the number of edges assigned to any vertex v ∈ C is at most Bv. The goal is to minimize the total weight of C.For a parameter ε0 we give a deterministic, distributed algorithm for the capVC problem that computes a vertex cover C of weight at most (2+ε) • opt where opt is the weight of a minimum-weight feasible solution to the given instance. The number of edges assigned to any node v ∈ C is at most (4+ε)• Bv. The running time of our algorithm is O(log (n W)/ε), where n is the number of nodes in the network and W=wtmax/weightmin is the ratio of largest to smallest weight.This result is complemented by a lower-bound saying that any distributed algorithm for capVC which requires a poly-logarithmic number of rounds is bound to violate the capacity constraints by a factor two.The main feature of the algorithm is that it is derived in a systematic fashion starting from a primal-dual sequential algorithm.