Many birds with one stone: multi-objective approximation algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Existence theorems, lower bounds and algorithms for scheduling to meet two objectives
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The Constrained Minimum Spanning Tree Problem (Extended Abstract)
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
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
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems
Theoretical Computer Science
Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
Theoretical Computer Science
Approximating Multiobjective Knapsack Problems
Management Science
Multicriteria Optimization
Approximation algorithms for the bi-criteria weighted MAX-CUT problem
Discrete Applied Mathematics
Approximating Multi-criteria Max-TSP
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Deterministic 7/8-approximation for the metric maximum TSP
Theoretical Computer Science
Improved deterministic approximation algorithms for Max TSP
Information Processing Letters
Budgeted matching and budgeted matroid intersection via the gasoline puzzle
Mathematical Programming: Series A and B
Deterministic algorithms for multi-criteria TSP
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
(Non)-approximability for the multi-criteria TSP(1, 2)
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Multi-Criteria TSP: min and max combined
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
A note on scheduling to meet two min-sum objectives
Operations Research Letters
Operations Research Letters
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem
Operations Research Letters
| Hi-index | 0.00 |
We propose an algorithm which returns a single Hamiltonian cycle with performance guarantee on both objectives. The algorithm is analysed in three cases. When both (resp. at least one) objective function(s) fulfill(s) the triangle inequality, the approximation ratio is 5/12-ε≈ 0.41 (resp. 3/8-ε). When the triangle inequality is not assumed on any objective function, the algorithm is {1+2√2}/14 - ε≈ 0.27-approximate.