Fast approximation algorithms for a nonconvex covering problem
Journal of Algorithms
Integer and combinatorial optimization
Integer and combinatorial optimization
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A constant-factor approximation algorithm for the k-median problem (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A polynomial-time approximation scheme for base station positioning in UMTS networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Structured p-facility location problems on the line solvable in polynomial time
Operations Research Letters
Optimal Location of Railway Stations: The Lisbon-Porto High-Speed Rail Line
Transportation Science
| Hi-index | 0.00 |
We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the general version, some interesting cases can be solved exactly by a suitable dynamic programming approach. For variants in which we also take into account existing connections between cities and railway tracks (streets, buses, etc.) we instead show some hardness results.