On Computing Broadcasting Trees inWireless Mesh Networks
暂无分享,去创建一个
[1] Refael Hassin,et al. Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..
[2] Robert E. Tarjan,et al. A quick method for finding shortest pairs of disjoint paths , 1984, Networks.
[3] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[4] Danny Raz,et al. A simple efficient approximation scheme for the restricted shortest path problem , 2001, Oper. Res. Lett..
[5] Morino Hiroaki,et al. Community Service Platform Using Wireless Logical Mesh Paths , 2007 .
[6] Sandy Irani,et al. Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems , 1999, DAC '99.