JOURNAL ARTICLE

Approximation algorithms for the min-max clustered k-traveling salesmen problems

Xiaoguang BaoLei XuWei YuWei Song

Year: 2022 Journal:   Theoretical Computer Science Vol: 933 Pages: 60-66   Publisher: Elsevier BV
Keywords:
Combinatorics Vertex (graph theory) Mathematics Travelling salesman problem Triangle inequality Approximation algorithm Undirected graph Integer (computer science) Graph Set (abstract data type) Running time Algorithm Discrete mathematics Computer science

Metrics

7
Cited By
1.11
FWCI (Field Weighted Citation Impact)
28
Refs
0.79
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Vehicle Routing Optimization Methods
Physical Sciences →  Engineering →  Industrial and Manufacturing Engineering
Facility Location and Emergency Management
Social Sciences →  Business, Management and Accounting →  Organizational Behavior and Human Resource Management
Optimization and Packing Problems
Physical Sciences →  Engineering →  Industrial and Manufacturing Engineering

Related Documents

JOURNAL ARTICLE

Exact and approximation algorithms for the min–max k-traveling salesmen problem on a tree

Liang XuZhou XuDongsheng Xu

Journal:   European Journal of Operational Research Year: 2013 Vol: 227 (2)Pages: 284-292
BOOK-CHAPTER

Approximation Algorithms for Min-Max Generalization Problems

Piotr BermanSofya Raskhodnikova

Lecture notes in computer science Year: 2010 Pages: 53-66
JOURNAL ARTICLE

Approximation Algorithms for Min-Max Generalization Problems

Piotr BermanSofya Raskhodnikova

Journal:   ACM Transactions on Algorithms Year: 2014 Vol: 11 (1)Pages: 1-23
© 2026 ScienceGate Book Chapters — All rights reserved.