A primal-dual approximation algorithm for the Minimum Cost Stashing problem in wireless sensor networks.
Salimur ChoudhuryKamrul IslamSelim G. AklPublished in: IPCCC (2010)
Keyphrases
- primal dual
- approximation algorithms
- minimum cost
- np hard
- linear programming
- dynamic programming
- approximation ratio
- convergence rate
- integrality gap
- wireless sensor networks
- dual formulation
- simplex algorithm
- computational complexity
- interior point methods
- semidefinite programming
- network flow
- spanning tree
- randomly generated
- worst case
- minimum cost flow
- optimal solution
- quadratic programming
- linear program
- path planning
- simulated annealing
- network flow problem
- network simplex algorithm