A fast 4-approximation algorithm for the traveling repairman problem on a line.
Sergio Luis Pérez-PérezLuis Eduardo Urbán RiveroRafael López-BrachoFrancisco Javier Zaragoza MartínezPublished in: CCE (2014)
Keyphrases
- cost function
- dynamic programming
- learning algorithm
- closed form
- improved algorithm
- detection algorithm
- np hard
- times faster
- experimental evaluation
- worst case
- high accuracy
- preprocessing
- probabilistic model
- recognition algorithm
- theoretical analysis
- expectation maximization
- particle swarm optimization
- computational cost
- computational complexity
- convergence rate
- error bounds
- randomized algorithm
- monte carlo
- tree structure
- optimization algorithm
- computationally efficient
- significant improvement
- k means
- evolutionary algorithm
- objective function