Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
On the approximability of trade-offs and optimal access of Web sources
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
Journal of the ACM (JACM)
Multicriteria Optimization
Improved deterministic approximation algorithms for Max TSP
Information Processing Letters
On approximating multicriteria TSP
ACM Transactions on Algorithms (TALG)
Multi-Criteria TSP: min and max combined
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Single approximation for biobjective max TSP
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Deterministic algorithms for multi-criteria Max-TSP
Discrete Applied Mathematics
| Hi-index | 0.00 |
We present randomized approximation algorithms for multi-criteria Max-TSP. For Max-STSP with k 1 objective functions, we obtain an approximation ratio of $\frac 1k - \varepsilon$ for arbitrarily small 茂戮驴 0. For Max-ATSP with kobjective functions, we obtain a ratio of $\frac{1}{k+1} - \varepsilon$.