A fast and simple randomized parallel algorithm for maximal matching
Information Processing Letters
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Parallel approximation algorithms for maximum weighted matching in general graphs
Information Processing Letters
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique
SIAM Journal on Discrete Mathematics
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximating weighted matchings in parallel
Information Processing Letters
Distributed approximate matching
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Beating Simplex for Fractional Packing and Covering Linear Programs
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Improved distributed approximate matching
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Local, distributed weighted matching on general and wireless topologies
Proceedings of the fifth international workshop on Foundations of mobile computing
Distributed and parallel algorithms for weighted vertex cover and other covering problems
Proceedings of the 28th ACM symposium on Principles of distributed computing
Social content matching in MapReduce
Proceedings of the VLDB Endowment
Iterative packing for demand and hypergraph matching
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Adaptive distributed b-matching in overlays with preferences
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Optimizing social welfare for network bargaining games in the face of unstability, greed and spite
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
A distributed algorithm for large-scale generalized matching
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
We present efficient distributed δ-approximation algorithms for FRACTIONAL PACKING AND MAXIMUM WEIGHTED b-MATCHING in hypergraphs, where δ is the maximum number of packing constraints in which a variable appears (for MAXIMUM WEIGHTED b-MATCHING δ is the maximum edge degree -- for graphs δ = 2). (a) For δ = 2 the algorithm runs in O(logm) rounds in expectation and with high probability. (b) For general δ, the algorithm runs in O(log2 m) rounds in expectation and with high probability.