An Approximation Algorithm for Optimal Clique Cover Delivery in Coded Caching.
Seyed Mohammad AsghariYi OuyangAshutosh NayyarAmir Salman AvestimehrPublished in: IEEE Trans. Commun. (2019)
Keyphrases
- optimal solution
- dynamic programming
- worst case
- computational cost
- experimental evaluation
- recognition algorithm
- significant improvement
- optimization algorithm
- exhaustive search
- computational complexity
- times faster
- matching algorithm
- closed form
- theoretical analysis
- detection algorithm
- path planning
- learning algorithm
- error tolerance
- locally optimal
- linear programming
- np hard
- segmentation algorithm
- particle swarm optimization
- motion estimation
- scheduling problem
- multi objective
- error bounds
- preprocessing
- weighted graph
- search algorithm
- decision trees
- polygonal approximation
- neural network