Distributed algorithms for matching in hypergraphs
From MaRDI portal
Publication:2117684
DOI10.1007/978-3-030-80879-2_3OpenAlexW3185821508MaRDI QIDQ2117684FDOQ2117684
Authors: Oussama Hanguir, Clifford Stein 
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/2009.09605
Cites Work
- Reducibility among combinatorial problems
- Title not available (Why is that?)
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Title not available (Why is that?)
- Title not available (Why is that?)
- Perfect matchings in random uniform hypergraphs
- Perfect matchings in random s‐uniform hypergraphs
- Title not available (Why is that?)
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- On the complexity of approximating \(k\)-set packing
- Title not available (Why is that?)
- Algorithm for optimal winner determination in combinatorial auctions
- On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
- Title not available (Why is that?)
- A fast and simple randomized parallel algorithm for maximal matching
- Coalition structure generation with worst case guarantees
- Title not available (Why is that?)
- On linear and semidefinite programming relaxations for hypergraph matching
- Approximating the \(k\)-set packing problem by local improvements
- Large neighborhood local search for the maximum set packing problem
- Communication steps for parallel query processing
- Greedy local improvement and weighted set packing approximation
- Sorting, searching, and simulation in the MapReduce framework
- Parallel algorithms for geometric graph problems
- Faster fully dynamic matchings with small approximation ratios
- Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation
- Improved massively parallel computation algorithms for MIS, matching, and vertex cover
- Randomized composable core-sets for distributed submodular maximization
- Title not available (Why is that?)
- Diverse near neighbor problem
- Round compression for parallel matching algorithms
- Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs
- Fully Dynamic Matching in Bipartite Graphs
Cited In (3)
Uses Software
This page was built for publication: Distributed algorithms for matching in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117684)
