Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems.
Amir AbboudVincent Cohen-AddadEuiwoong LeePasin ManurangsiPublished in: ICALP (2022)
Keyphrases
- approximation algorithms
- vertex cover
- lower bound
- np hard
- randomized algorithms
- worst case
- network design problem
- special case
- upper bound
- approximation schemes
- search algorithm
- search space
- exact algorithms
- set cover
- np hardness
- minimum cost
- approximation ratio
- facility location problem
- branch and bound
- practical problems
- practical solutions
- integer programming
- strongly np hard
- solution space
- open shop
- disjoint paths