Optimal fractional competitive ratio of (e-1)/(e+1) for online matching on 3-uniform hypergraphs via primal-dual method and matching adversarial lower bound.
Improved approximation for 3-dimensional matching via bounded pathwidth local search
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Online Matching on $3$-Uniform Hypergraphs
Optimal fractional competitive ratio of (e-1)/(e+1) for online matching on 3-uniform hypergraphs via primal-dual method and matching adversarial lower bound.