Approximation Algorithms for the Max-Buying Problem with Limited Supply.
Cristina G. FernandesRafael Crivellari Saliba SchoueryPublished in: Algorithmica (2018)
Keyphrases
- approximation algorithms
- np hard
- worst case
- special case
- vertex cover
- minimum cost
- np hardness
- approximation ratio
- facility location problem
- set cover
- primal dual
- exact algorithms
- network design problem
- open shop
- approximation schemes
- precedence constraints
- constant factor approximation
- greedy heuristic
- randomized algorithms
- lower bound
- scheduling problem