Certified Approximation Algorithms for the Fermat Point and n-Ellipses.
Kolja JungingerIoannis MantasEvanthia PapadopoulouMartin SuderlandChee YapPublished in: ESA (2021)
Keyphrases
- approximation algorithms
- np hard
- vertex cover
- special case
- minimum cost
- worst case
- open shop
- facility location problem
- primal dual
- network design problem
- approximation ratio
- set cover
- constant factor
- approximation schemes
- randomized algorithms
- constant factor approximation
- genetic algorithm
- np hardness
- precedence constraints
- exact algorithms
- linear programming
- polynomial time approximation
- combinatorial auctions