Engineering hypergraph b-matching algorithms
From MaRDI portal
Engineering hypergraph \(b\)-matching algorithms
Cites work
- k-way hypergraph partitioning via n-level recursive bisection
- A measure \& conquer approach for the analysis of exact algorithms
- A simple approximation algorithm for the weighted matching problem
- Algorithms for Secretary Problems on Graphs and Hypergraphs
- An improved approximation for maximum weighted \(k\)-set packing
- Approximating the k-set packing problem by local improvements
- Benchmarking optimization software with performance profiles.
- Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Concerning nonnegative matrices and doubly stochastic matrices
- Data reduction and exact algorithms for clique cover
- Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
- Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality
- Effective data reduction for the vertex clique cover problem
- Efficient approximation algorithms for weighted b-matching
- Enabling research through the SCIP Optimization Suite 8.0
- Exactly solving the maximum weight independent set problem on large real-world graphs
- Fast local search for the maximum independent set problem
- Finding near-optimal independent sets at scale
- Generalized hypergraph matching via iterated packing and local ratio
- Greedy in Approximation Algorithms
- Handbook of Approximation Algorithms and Metaheuristics
- How to sell hyperedges: the hypermatching assignment problem
- scientific article; zbMATH DE number 1617260 (Why is no real title available?)
- scientific article; zbMATH DE number 432790 (Why is no real title available?)
- scientific article; zbMATH DE number 1304326 (Why is no real title available?)
- Implementing weighted b-matching algorithms
- Improved approximation for 3-dimensional matching via bounded pathwidth local search
- Inapproximability of b-matching in k-uniform hypergraphs
- Linear-time approximation for maximum weight matching
- Mathematical Foundations of Computer Science 2005
- On the complexity of approximating \(k\)-set packing
- On the power of simple reductions for the maximum independent set problem
- Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists
- Parameterized algorithms
- Passing the limits of pure local search for weighted \(k\)-Set packing
- Paths, Trees, and Flowers
- Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach
- Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the F\"uredi, Kahn, and Seymour Conjecture
- Solving matching problems with linear programming
- Solving the maximum clique and vertex coloring problems on very large sparse networks
- Technical note -- Online hypergraph matching with delays
- The b-matching problem in hypergraphs: hardness and approximability
- The University of Florida sparse matrix collection
This page was built for publication: Engineering hypergraph \(b\)-matching algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7357261)
