Near‐shortest and K‐shortest simple paths
暂无分享,去创建一个
[1] Deep Medhi,et al. The use of hop-limits to provide survivable ATM group communications , 2000, COMM '00.
[2] Dalit Naor,et al. On Near-Optimal Alignments of Biological Sequences , 1994, J. Comput. Biol..
[3] R. Kevin Wood,et al. Shortest‐path network interdiction , 2002, Networks.
[4] U. Pape,et al. Implementation and efficiency of Moore-algorithms for the shortest route problem , 1974, Math. Program..
[5] T. Lindvall. ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.
[6] Walter Willinger,et al. Toward an optimization-driven framework for designing and generating realistic Internet topologies , 2003, CCRV.
[7] Robert E. Tarjan,et al. Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.
[8] Nicos Christofides,et al. An efficient implementation of an algorithm for finding K shortest simple paths , 1999, Networks.
[9] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[10] David Eppstein,et al. Finding the k Shortest Paths , 1999, SIAM J. Comput..
[11] Michalis Faloutsos,et al. On power-law relationships of the Internet topology , 1999, SIGCOMM '99.
[12] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[13] Michael S. Waterman,et al. Technical Note - Determining All Optimal and Near-Optimal Solutions when Solving Shortest Path Problems by Dynamic Programming , 1984, Oper. Res..
[14] Wayne D. Grover,et al. Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks , 1998, TNET.
[15] M. Herzberg,et al. The hop-limit approach for spare-capacity assignment in survivable networks , 1995, TNET.