Provably Efficient Resource Allocation of Cloud Native Functions For Network Services
- 2 January 2026
- book chapter
- Published by Springer Nature
- p. 441-451
Abstract
No abstract availableKeywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Cloud-Native Service Mesh Readiness for 5G and BeyondIEEE Access, 2023
- Joint Placement and Allocation of VNF Nodes With Budget and Capacity ConstraintsIEEE/ACM Transactions on Networking, 2021
- Provably Efficient Algorithms for Placement of Service Function Chains with Ordering Constraints2018
- Provably efficient algorithms for joint placement and allocation of virtual network functions2017
- A note on the set union knapsack problemDiscrete Applied Mathematics, 2014
- A Polynomial Time Approximation Scheme for the Multiple Knapsack ProblemSIAM Journal on Computing, 2005
- A New Fully Polynomial Time Approximation Scheme for the Knapsack ProblemJournal of Combinatorial Optimization, 1999
- The budgeted maximum coverage problemInformation Processing Letters, 1999
- Note: On the set-union knapsack problemNaval Research Logistics (NRL), 1994
- An approximation algorithm for the generalized assignment problemMathematical Programming, 1993