The paper gives O(log n) and O(log n/log log n) approximation algorithms for revenue-optimal fare zone assignment on trees, exact solutions for rooted instances, and hardness results including APX-hardness on stars and strong NP-hardness on paths.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fare Zone Assignment on Trees
The paper gives O(log n) and O(log n/log log n) approximation algorithms for revenue-optimal fare zone assignment on trees, exact solutions for rooted instances, and hardness results including APX-hardness on stars and strong NP-hardness on paths.