Online Stochastic Weighted Matching: Improved Approximation Algorithms.
Bernhard HaeuplerVahab S. MirrokniMorteza ZadimoghaddamPublished in: WINE (2011)
Keyphrases
- approximation algorithms
- np hard
- approximation schemes
- special case
- vertex cover
- np hardness
- worst case
- minimum cost
- facility location problem
- online learning
- network design problem
- disjoint paths
- approximation ratio
- primal dual
- set cover
- graph matching
- polynomial time approximation
- scheduling problem
- online algorithms
- open shop
- randomized algorithms
- computational complexity
- genetic algorithm