Finding k-dissimilar paths with minimum collective length
暂无分享,去创建一个
Ulf Leser | David B. Blumenthal | Johann Gamper | Theodoros Chondrogiannis | Panagiotis Bouros | U. Leser | Theodoros Chondrogiannis | J. Gamper | Panagiotis Bouros
[1] Tali Eilam-Tzoreff,et al. The Disjoint Shortest Paths Problem , 1998, Discret. Appl. Math..
[2] Yongtaek Lim,et al. A SHORTEST PATH ALGORITHM FOR REAL ROAD NETWORK BASED ON PATH OVERLAP , 2005 .
[3] Ulf Leser,et al. Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap , 2017, EDBT.
[4] Dennis Luxen,et al. Candidate Sets for Alternative Routes in Road Networks , 2012, SOCS.
[5] David Thomas,et al. The Art in Computer Programming , 2001 .
[6] Yeon-Jeong Jeong,et al. A dissimilar alternative paths-search algorithm for navigation services: A heuristic approach , 2010 .
[7] Sanjeev Arora,et al. Computational Complexity: A Modern Approach , 2009 .
[8] Ulf Leser,et al. Alternative routing: k-shortest paths with limited overlap , 2015, SIGSPATIAL/GIS.
[9] Sybil Derrible,et al. A protocol to convert spatial polyline data to network formats and applications to world urban road networks , 2016, Scientific Data.
[10] Donald E. Knuth,et al. The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming) , 2005 .
[11] Hans-Peter Kriegel,et al. Route skyline queries: A multi-preference path planning approach , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).
[12] Subhash Suri,et al. Finding the k shortest simple paths , 2007, ALENEX.
[13] Hanan Samet,et al. Scalable network distance browsing in spatial databases , 2008, SIGMOD Conference.
[14] Aoying Zhou,et al. Finding Top-k Shortest Paths with Diversity , 2018, IEEE Transactions on Knowledge and Data Engineering.
[15] Andrew V. Goldberg,et al. Alternative routes in road networks , 2010, JEAL.
[16] Roland Bader,et al. Alternative Route Graphs in Road Networks , 2011, TAPAS.
[17] Erhan Erkut,et al. On finding dissimilar paths , 2000, Eur. J. Oper. Res..
[18] Matthias Schubert,et al. Linear path skylines in multicriteria networks , 2015, 2015 IEEE 31st International Conference on Data Engineering.
[19] J. Y. Yen,et al. Finding the K Shortest Loopless Paths in a Network , 2007 .
[20] Kai Zheng,et al. Finding Alternative Shortest Paths in Spatial Networks , 2012, TODS.
[21] Dorothea Wagner,et al. Pareto Paths with SHARC , 2009, SEA.
[22] Kyriakos Mouratidis,et al. Preference queries in large multi-cost transportation networks , 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).