Effective Heuristics for Matchings in Hypergraphs
- 14 November 2019
- book chapter
- Published by Springer Nature
- p. 248-264
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Approximation algorithms for maximum matchings in undirected graphs2018
- Perfect Fractional Matchings in $k$-Out HypergraphsThe Electronic Journal of Combinatorics, 2017
- Two approximation algorithms for bipartite matching on multicore architecturesJournal of Parallel and Distributed Computing, 2015
- Improved Approximation for 3-Dimensional Matching via Bounded Pathwidth Local Search2013
- How to Sell Hyperedges: The Hypermatching Assignment Problem2013
- Hall's theorem for hypergraphsJournal of Graph Theory, 2000
- Structure Prediction and Computation of Sparse Matrix ProductsJournal of Combinatorial Optimization, 1998
- Randomized greedy matchingRandom Structures & Algorithms, 1991
- On the scaling of multidimensional matricesLinear Algebra and its Applications, 1989
- Maximum matchings in a class of random graphsJournal of Combinatorial Theory, Series B, 1986