REVIEW 2 cited by
Fair Railway Network Design
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
When designing a public transportation network in a country, one may want to minimise the sum of travel duration of all inhabitants. This corresponds to a purely utilitarian view and does not involve any fairness consideration, as the resulting network will typically benefit the capital city and/or large central cities while leaving some peripheral cities behind. On the other hand, a more egalitarian view will allow some people to travel between peripheral cities without having to go through a central city. We define a model, propose algorithms for computing solution networks, and report on experiments based on real data.
Forward citations
Cited by 2 Pith papers
-
Fair Transit Stop Placement: A Clustering Perspective and Beyond
A new "Expanding Cost" algorithm guarantees a tight (1+√2)-approximation to justified representation for fair transit stop placement in general metric spaces, even with arbitrary transit times.
-
Fair and Efficient Investment in Public Transportation
Fair bus-stop placement is NP-hard on a line; upgrading network edges is polynomial for one or two agents but NP-hard and inapproximable with many agents.
Discussion (0). Continue with ORCID to comment.