Approximation algorithms for the MAXSPACE advertisement problem.
Mauro R. C. da SilvaLehilton L. C. PedrosaRafael C. S. SchoueryPublished in: CoRR (2020)
Keyphrases
- approximation algorithms
- special case
- np hard
- worst case
- minimum cost
- vertex cover
- facility location problem
- set cover
- network design problem
- primal dual
- exact algorithms
- approximation schemes
- approximation ratio
- precedence constraints
- np hardness
- spanning tree
- genetic algorithm
- undirected graph
- constant factor
- polynomial time approximation
- search space