Approximation algorithms for stochastic online matching with reusable resources.
Meghan ShanksGe YuSheldon H. JacobsonPublished in: Math. Methods Oper. Res. (2023)
Keyphrases
- approximation algorithms
- approximation schemes
- special case
- np hard
- vertex cover
- worst case
- minimum cost
- open shop
- online learning
- set cover
- randomized algorithms
- primal dual
- facility location problem
- undirected graph
- disjoint paths
- np hardness
- approximation ratio
- online resources
- constant factor approximation
- network design problem
- precedence constraints
- resource constraints
- constant factor
- error bounds
- search algorithm