Diminishing cold starts in serverless computing with approximation algorithms.
Tomasz KanasKrzysztof RzadcaPublished in: ICPP (2024)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- facility location problem
- vertex cover
- network design problem
- set cover
- primal dual
- randomized algorithms
- approximation ratio
- open shop
- approximation schemes
- constant factor
- np hardness
- precedence constraints
- undirected graph
- exact algorithms
- metaheuristic
- computational complexity
- network flow
- disjoint paths