New O(n²) dynamic programming algorithm for path-metric TTP tour optimization with fixed packing, plus NP-hardness on stars and constant-factor approximations for star and general metrics with linear costs.
Papadimitriou and Mihalis Yannakakis
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Effective Traveling for Metric Instances of the Traveling Thief Problem
New O(n²) dynamic programming algorithm for path-metric TTP tour optimization with fixed packing, plus NP-hardness on stars and constant-factor approximations for star and general metrics with linear costs.