Approximation Algorithms for the Max-Buying Problem with Limited Supply.
Cristina G. FernandesRafael Crivellari Saliba SchoueryPublished in: LATIN (2014)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- minimum cost
- worst case
- primal dual
- exact algorithms
- facility location problem
- network design problem
- set cover
- approximation ratio
- randomized algorithms
- constant factor
- precedence constraints
- open shop
- np hardness
- undirected graph
- polynomial time approximation
- approximation schemes
- optimal solution
- disjoint paths