A (9+ε, 9+ε)-approximate Pareto set for the Traveling Thief Problem and a (2e+ε)-approximation for Weighted TSP are computable in polynomial time.
International Conference on Integer Programming and Combinatorial Optimization , pages=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Approximation Algorithms for the Traveling Thief Problem
A (9+ε, 9+ε)-approximate Pareto set for the Traveling Thief Problem and a (2e+ε)-approximation for Weighted TSP are computable in polynomial time.