Semi-streaming algorithms for hypergraph matching
From MaRDI portal
Cites work
- A \((2+\epsilon)\)-approximation for maximum weight matching in the semi-streaming model
- A simple approximation algorithm for the weighted matching problem
- A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching
- An Analysis of the Greedy Heuristic for Independence Systems
- Approximation algorithms in combinatorial scientific computing
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Benchmarking optimization software with performance profiles.
- Decomposing combinatorial auctions and set packing problems
- Distributed algorithms for matching in hypergraphs
- Engineering Algorithms for Approximate Weighted Matching
- Greedy matching: guarantees and limitations
- scientific article; zbMATH DE number 1617260 (Why is no real title available?)
- scientific article; zbMATH DE number 1304326 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Improved approximation for 3-dimensional matching via bounded pathwidth local search
- On graph problems in a semi-streaming model
- On the complexity of approximating \(k\)-set packing
- 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
- Passing the limits of pure local search for weighted \(k\)-Set packing
- Paths, Trees, and Flowers
- Reducibility among combinatorial problems
- Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints
- Semi-streaming algorithms for weighted k-disjoint matchings
- Simplified and space-optimal semi-streaming (2+)-approximate matching
- The design of approximation algorithms
- The University of Florida sparse matrix collection
This page was built for publication: Semi-streaming algorithms for hypergraph matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322487)