Parameterized algorithms and complexity for the traveling purchaser problem and its variants.
Mingyu XiaoJianan ZhangWeibo LinPublished in: J. Comb. Optim. (2022)
Keyphrases
- computational cost
- computational complexity
- worst case
- space complexity
- recently developed
- learning algorithm
- related algorithms
- data structure
- clustering algorithm
- lower complexity
- significant improvement
- computationally efficient
- high computational complexity
- computationally complex
- real time
- exact and approximate
- traveling salesman problem
- times faster
- benchmark datasets
- theoretical analysis
- simulated annealing
- face recognition
- image segmentation
- data sets