The paper proves the symmetric offloading problem is NP-hard and claims a polynomial-time submodular-minimization solution under a communication-cost assumption, but the proof of the algorithmic claim is flawed.
A potential game theoretic approach to computation offloading strategy optimization in end-edge-cloud com- puting,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Algorithmics and Complexity of Cost-Driven Task Offloading with Submodular Optimization in Edge-Cloud Environments
The paper proves the symmetric offloading problem is NP-hard and claims a polynomial-time submodular-minimization solution under a communication-cost assumption, but the proof of the algorithmic claim is flawed.