Publisher
Springer Berlin Heidelberg
Reference40 articles.
1. Agrawal, R., Jagadish, H.: Algorithms for Searching Massive Graphs. IEEE Transact. Knowledge and Data Eng. 6, 225–238 (1994)
2. Lecture Notes in Computer Science;U. Brandes,2001
3. Brodal, G.S., Jacob, R.: Time-dependent networks as models to achieve fast exact time-table queries. Technical Report ALCOMFT-TR-01-176, ALCOM-FT (September 2001)
4. Bussiek, M.R., Winter, T., Zimmermann, U.T.: Discrete optimization in public rail transport. Mathematical Programming 79(3), 415–444 (1997)
5. Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Operations Research 47(5), 730–743 (1999)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献