Improving customer proximity to railway stations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2653, Issue , 2003, Pages 264-276

  Kranakis, Evangelos ^a   Penna, Paolo ^b   Schlude, Konrad ^b   Taylor, David Scot ^c   Widmayer, Peter ^b  

^a CARLETON UNIVERSITY   (Canada)

^b ETH ZURICH   (Switzerland)

^c SAN JOSE STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; HARDNESS; RAILROAD TRACKS; RAILROADS; TRANSPORTATION;

GENERAL VERSION; HARDNESS RESULT; NP-HARDNESS; RAILWAY STATIONS; RAILWAY TRACK;

DYNAMIC PROGRAMMING;

EID: 35048828817     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44849-7_30     Document Type: Article

References (18)

1. 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.
2. 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.
3. 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.
4. 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.
5. 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.
6. 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.
7. R. Hassin and A. Tamir. Improved complexity bounds for location problems on the real line. Operations Research Letters, 10:395-402, 1991.
8. D.S. Hochbaum and W. Maass. Fast approximation algorithms for a nonconvex covering problem. Journal of Algorithms, 8:305-323, 1987.
9. 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.
10. 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.
11. J. Jermann. Private communication. A decision support tool for placing new stations in the SBB railway network.
12. 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.
13. G.L. Nemhauser and L.A. Wolsey. Integer and Combinatorial Optimization. Wiley, 1988.
14. C. H. Papadimitriou. Worst-case and probabilistic analysis of a geometric location problem. SIAM J. Comput., 10, 1981.
15. A. Schöbel. Set covering problems with consecutive ones property. Technical report, Universität Keiserslautern, 2001.
16. 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.
17. D.B. Shmoys, É. Tardos, and K. Aardal. Approximation algorithms for facility location problems. In Proc. of the 29th ACM STOC, pages 265-274, 1997.
18. A. Tamir. Personal comunication. July 2002.