A randomized algorithm for the fixed-length routing problem.
Tieyuan PanRan ZhangYasuhiro TakashimaTakahiro WatanabePublished in: APCCAS (2014)
Keyphrases
- routing problem
- fixed length
- randomized algorithm
- variable length
- greedy algorithm
- lower bound
- feature vectors
- vehicle routing problem
- routing algorithm
- shortest path
- competitive ratio
- traveling salesman problem
- travel time
- global optimization
- bitstream
- data mining
- n gram
- upper bound
- multi objective
- search algorithm
- genetic algorithm