Approximation algorithms for data-intensive service chain embedding.
Konstantinos PoularakisJaime LlorcaAntonia Maria TulinoLeandros TassiulasPublished in: MobiHoc (2020)
Keyphrases
- approximation algorithms
- data intensive
- web services
- special case
- data management
- np hard
- data access
- worst case
- vertex cover
- minimum cost
- big data
- primal dual
- set cover
- grid computing
- earth science
- approximation ratio
- constant factor
- randomized algorithms
- linear programming
- approximation guarantees
- disjoint paths
- data processing
- management system
- query processing