Approximation Algorithms for the MAXSPACE Advertisement Problem.
Lehilton L. C. PedrosaMauro R. C. da SilvaRafael C. S. SchoueryPublished in: Theory Comput. Syst. (2024)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- facility location problem
- minimum cost
- primal dual
- network design problem
- exact algorithms
- constant factor
- approximation ratio
- open shop
- randomized algorithms
- precedence constraints
- np hardness
- learning algorithm
- undirected graph
- disjoint paths
- set cover
- traveling salesman problem