An efficient algorithm for finding a path subject to two additive constraints
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Path selection under multiple QoS constraints - a practical approach
Journal of High Speed Networks
Fast and efficient routing algorithms for delay-bounded and dependable channels
Computer Communications
International Journal of Applied Mathematics and Computer Science
A lazy version of Eppstein's K shortest paths algorithm
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
A method of network simplification in a 4PL system
CSCWD'04 Proceedings of the 8th international conference on Computer Supported Cooperative Work in Design I
A Scalable QoS-based inter-domain routing scheme in a high speed wide area network
Computer Communications
Golden ratio versus pi as random sequence sources for Monte Carlo integration
Mathematical and Computer Modelling: An International Journal
Intelligent transportation systems-Enabling technologies
Mathematical and Computer Modelling: An International Journal
Topology and routing optimization for congestion minimization in optical wireless networks
Optical Switching and Networking
An efficient algorithm for finding a path subject to two additive constraints
Computer Communications
| Hi-index | 0.00 |