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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Equivalence relations recover coordinate factors from metric products, exactly characterizing finite product/power presentations via category equivalence and binary tree structures for self-product spaces, with application to persistent homology.
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.
-
Square Metric Spaces
Equivalence relations recover coordinate factors from metric products, exactly characterizing finite product/power presentations via category equivalence and binary tree structures for self-product spaces, with application to persistent homology.