Technical note -- Online hypergraph matching with delays
From MaRDI portal
Recommendations
Cites work
- A \(d/2\) approximation for maximum weight independent set in \(d\)-claw free graphs
- A Greedy Heuristic for the Set-Covering Problem
- A threshold of ln n for approximating set cover
- Algorithms for Secretary Problems on Graphs and Hypergraphs
- An approximation algorithm for network revenue management under nonstationary arrivals
- Approximation algorithms for combinatorial problems
- Greedy local improvement and weighted set packing approximation
- Min-cost bipartite perfect matching with delays
- Non-approximability results for optimization problems on bounded degree instances
- On linear and semidefinite programming relaxations for hypergraph matching
- On the complexity of approximating \(k\)-set packing
- On the ratio of optimal integral and fractional covers
- Online matching: haste makes waste!
Cited in
(12)- Online spatio-temporal matching in stochastic and dynamic domains
- Online generalized assignment problem with historical information
- Online crowdsourced truck delivery using historical information
- Deterministic primal-dual algorithms for online k-way matching with delays
- Deterministic primal-dual algorithms for online \(k\)-way matching with delays
- Online matching on 3-uniform hypergraphs
- Stability in online coalition formation
- Almost tight bounds for online hypergraph matching
- A decomposition-based approach for large-scale pickup and delivery problems
- Online matching with delays and size-based costs
- Engineering hypergraph b-matching algorithms
- Mix and match: Markov chains and mixing times for matching in rideshare
This page was built for publication: Technical note -- Online hypergraph matching with delays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5106363)
