Abstract
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.
Work partially supported by the Swiss Federal Office for Education and Science under the Human Potential Programme of the European Union under contract no. HPRN-CT-1999-00104 (AMORE).
Research of E. Kranakis was supported in part by NSERC (Natural Sciences and Engineering Research Council of Canada) and MITACS (Mathematics of Information Technology and Complex Systems) grants.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Arora, P. Raghavan, and S. Rao. Polynomial Time Approximation Schemes for Euclidean k-medians and related problems. In Proc. of the 30th ACM STOC, pages 106–113, 1998.
M. Charikar, S. Guha, É. Tardos, and D.B. Shmoys. A constant-factor approximation algorithm for the k-median problem. In Proc of the 31st ACM STOC, pages 1–10, 1999.
M.S. Daskin. Network and Discrete Location: Models Algorithms, and Applications. Wiley-Interscience series in Discrete Mathematics and Optimization. John Wiley and Sons, Inc, 1995.
M. Galota, C. Glasser, S. Reith, and H. Vollmer. A Polynomial-Time Approximation Scheme for Base Station Positioning in UMTS Networks. In Proc. of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, DIALM, pages 52–59, 2001.
S. Gupta and S. Kuller. Greedy strikes back: improved facility location algorithms. In Proc. of 9th ACM-SIAM Symposium on Descrete Algorithms, SODA, pages 649–657, 1998.
H.W. Hamacher, A. Liebers, A. Schöbel, D. Wagner, and F. Wagner. Locating new stops in a railway network. In Proc. of the ATMOS workshop, Algorithmic Methods and Models for Optimization of Railways, Electronic Notes in Theoretical Computer Science, pages 15–25. Elsevier Science, 2001.
R. Hassin and A. Tamir. Improved complexity bounds for location problems on the real line. Operations Research Letters, 10:395–402, 1991.
D.S. Hochbaum and W. Maass. Fast approximation algorithms for a nonconvex covering problem. Journal of Algorithms, 8:305–323, 1987.
V.N. Hsu, T.J. Lowe, and A. Tamir. Structured p-facility location problems on the line solvable in polynomial time. Operations Research Letters, 21:159–164, 1997.
K. Jain and V. V. Vazirani. Primal-dual approximation algorithms for metric facility location and k-median problems. In IEEE FOCS, pages 2–13, 1999.
J. Jermann. Private communication. A decision support tool for placing new stations in the SBB railway network.
E. Kranakis, P. Penna, K. Schlude, D.S. Taylor, and P. Widmayer. Improving customer proximity to railway stations. Technical Report 371, Institute for Theoretical Computer Science, ETH Zurich, http://www.inf.ethz.ch, 2002.
G.L. Nemhauser and L.A. Wolsey. Integer and Combinatorial Optimization. Wiley, 1988.
C. H. Papadimitriou. Worst-case and probabilistic analysis of a geometric location problem. SIAM J. Comput., 10, 1981.
A. Schöbel. Set covering problems with consecutive ones property. Technical report, Universität Keiserslautern, 2001.
A. Schöbel, H.W. Hamacher, A. Liebers, and D. Wagner. The continuous stop location problem in public transportation networks. Submitted to international journal, 2002.
D.B. Shmoys, É. Tardos, and K. Aardal. Approximation algorithms for facility location problems. In Proc. of the 29th ACM STOC, pages 265–274, 1997.
A. Tamir. Personal comunication. July 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kranakis, E., Penna, P., Schlude, K., Taylor, D.S., Widmayer, P. (2003). Improving Customer Proximity to Railway Stations. In: Petreschi, R., Persiano, G., Silvestri, R. (eds) Algorithms and Complexity. CIAC 2003. Lecture Notes in Computer Science, vol 2653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44849-7_30
Download citation
DOI: https://doi.org/10.1007/3-540-44849-7_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40176-6
Online ISBN: 978-3-540-44849-5
eBook Packages: Springer Book Archive