Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Computing Partitions with Applications to the Knapsack Problem
Journal of the ACM (JACM)
A randomized algorithm for finding a path subject to multiple QoS requirements
Computer Networks: The International Journal of Computer and Telecommunications Networking
Heuristic algorithms for multiconstrained quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Data Structures, Algorithms, And Applications In C++
Data Structures, Algorithms, And Applications In C++
Constraint-based routing in the internet: Basic principles and recent research
IEEE Communications Surveys & Tutorials
An overview of constraint-based path selection algorithms for QoS routing
IEEE Communications Magazine
An efficient algorithm for finding a path subject to two additive constraints
Computer Communications
A simple efficient approximation scheme for the restricted shortest path problem
Operations Research Letters
IEEE Network: The Magazine of Global Internetworking
Multiconstrained QoS Routing: A Norm Approach
IEEE Transactions on Computers
Design and implementation of a scalable constraint-based routing module for QoS path computation
Proceedings of the 4th international IFIP/ACM Latin American conference on Networking
Design and performance analysis of an inductive QoS routing algorithm
Computer Communications
A distributed parallel QoS routing algorithm with multi-path probing
CCDC'09 Proceedings of the 21st annual international conference on Chinese Control and Decision Conference
A survey on multi-constrained optimal path computation: Exact and approximate algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing with multiple quality-of-services constraints: An approximation perspective
Journal of Network and Computer Applications
Hi-index | 14.99 |
We propose six new heuristics to find a source-to-destination path that satisfies two or more additive constraints on edge weights. Five of these heuristics become \epsilon{\hbox{-}}{\rm approximation} algorithms when their parameters are appropriately set. The performance of our new heuristics is compared experimentally with that of two recently proposed heuristics for the same problem.