An approximation algorithm for the wireless gathering problem.
Vincenzo BonifaciPeter KortewegAlberto Marchetti-SpaccamelaLeen StougiePublished in: Oper. Res. Lett. (2008)
Keyphrases
- computational cost
- learning algorithm
- times faster
- closed form
- detection algorithm
- optimization algorithm
- np hard
- dynamic programming
- improved algorithm
- computational complexity
- classification algorithm
- high accuracy
- approximation ratio
- monte carlo
- theoretical analysis
- computationally efficient
- objective function
- optimal solution
- preprocessing
- cost function
- k means
- polynomial time approximation
- search algorithm
- matching algorithm
- significant improvement
- probabilistic model
- worst case
- expectation maximization
- particle swarm optimization
- input data
- search space
- convex hull
- data sets