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.
Title resolution pending
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 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.