pith. sign in

Title resolution pending

Three cuts in block (B), no cuts in blocks (A), (C)

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.DS 1

years

2025 1

verdicts

UNVERDICTED 1

representative citing papers

Fare Zone Assignment on Trees

cs.DS · 2025-12-22 · unverdicted · novelty 6.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Fare Zone Assignment on Trees cs.DS · 2025-12-22 · unverdicted · none · ref 28

    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.