A Note on Approximation Algorithms for the Multicriteria \(\Delta\)-TSP
1995
The Tree and Christofides heuristic are weil known 1- and \(\frac{1} {2}\)- approximate algorithms for the \(\Delta\)-TSP. In this note their performance for the multicriteria case is described, depending on the norm in \(\mathbb{R}^Q\) in case of \(Q\) criteria.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI