Online Matching on 3-Uniform Hypergraphs
- 4 June 2025
- book chapter
- Published by Springer Nature
- p. 100-113
Abstract
No abstract availableKeywords
All Related Versions
This publication has 31 references indexed in Scilit:
- Almost tight bounds for online hypergraph matchingOperations Research Letters, 2024
- Online Combinatorial Assignment in Independence Systems2024
- Online Algorithms for Maximum Cardinality Matching with Edge ArrivalsAlgorithmica, 2018
- Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm2015
- An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions2013
- On linear and semidefinite programming relaxations for hypergraph matchingMathematical Programming, 2011
- Algorithms for Secretary Problems on Graphs and Hypergraphs2009
- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue2007
- On the complexity of approximating k-set packingcomputational complexity, 2006
- An optimal deterministic algorithm for online b-matchingTheoretical Computer Science, 2000