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