A new algorithm approximates the prize-collecting rural postman problem within a factor strictly less than 1.6 and proves a 2-approximation barrier for PCTSP reductions.
X., Simchi-Levi, D., & Williamson, D
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2representative citing papers
Reduction from prize-collecting-Φ-TSP to prize-collecting TSP yields (ρ + ε)-approximations for constant prescribed vertices, improving the prize-collecting stroll guarantee to better than 1.6 from 1.6662.
citing papers explorer
-
Approximation algorithms for the prize-collecting rural postman problem
A new algorithm approximates the prize-collecting rural postman problem within a factor strictly less than 1.6 and proves a 2-approximation barrier for PCTSP reductions.