Approximation of Pareto optima in multiple-objective, shortest-path problems
Operations Research
Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
The network inhibition problem
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
QoS routing in networks with uncertain parameters
IEEE/ACM Transactions on Networking (TON)
Errata and comments on “Approximation algorithms for the capacitated plant allocation problem”
Operations Research Letters
Optimal partition of QoS requirements with discrete cost functions
IEEE Journal on Selected Areas in Communications
The Quickest Multicommodity Flow Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A PTAS for weight constrained Steiner trees in series-parallel graphs
Theoretical Computer Science
Precomputation schemes for QoS routing
IEEE/ACM Transactions on Networking (TON)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Algorithms for computing QoS paths with restoration
IEEE/ACM Transactions on Networking (TON)
Algorithms for precomputing constrained widest paths and multicast trees
IEEE/ACM Transactions on Networking (TON)
Approximation Algorithms for Multiconstrained Quality-of-Service Routing
IEEE Transactions on Computers
Efficiently computing succinct trade-off curves
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
IEEE Transactions on Computers
Replicated Server Placement with QoS Constraints
IEEE Transactions on Parallel and Distributed Systems
Efficient QoS partition and routing of unicast and multicast
IEEE/ACM Transactions on Networking (TON)
Finding a path subject to many additive QoS constraints
IEEE/ACM Transactions on Networking (TON)
Multiconstrained QoS Routing: A Norm Approach
IEEE Transactions on Computers
Approximation schemes for a class of subset selection problems
Theoretical Computer Science
Path selection under multiple QoS constraints - a practical approach
Journal of High Speed Networks
Approximation algorithm for the temperature-aware scheduling problem
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Polynomial time approximation algorithms for multi-constrained QoS routing
IEEE/ACM Transactions on Networking (TON)
Optimal routing for end-to-end guarantees using Network Calculus
Performance Evaluation
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
ANT Based Routing Algorithm over a HAP Network with Integrated Services
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Routing connections with differentiated reliability requirements in WDM mesh networks
IEEE/ACM Transactions on Networking (TON)
Real-Time Message Routing and Scheduling
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
International Journal of Applied Mathematics and Computer Science
Reliable adaptive multipath provisioning with bandwidth and differential delay constraints
INFOCOM'10 Proceedings of the 29th conference on Information communications
An ant colony optimization algorithm for the bi-objective shortest path problem
Applied Soft Computing
A survey on multi-constrained optimal path computation: Exact and approximate algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximation schemes for multi-budgeted independence systems
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
INFORMS Journal on Computing
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
SIAM Journal on Computing
Directed spanners via flow-based linear programs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Computers and Operations Research
QoS routing algorithms using fully polynomial time approximation scheme
Proceedings of the Nineteenth International Workshop on Quality of Service
A note on approximating the min-max vertex disjoint paths on directed acyclic graphs
Journal of Computer and System Sciences
Delay coerced multi constrained quality of service routing algorithm
WSEAS Transactions on Information Science and Applications
Reliable and restricted quickest path problems
INOC'11 Proceedings of the 5th international conference on Network optimization
Routing with multiple quality-of-services constraints: An approximation perspective
Journal of Network and Computer Applications
Improved approximation algorithms for Directed Steiner Forest
Journal of Computer and System Sciences
Near linear time (1 + ε)-approximation for restricted shortest paths in undirected graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A comparison of exact and ε-approximation algorithms for constrained routing
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Replicated server placement with qos constraints
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
Unicast and multicast qos routing with multiple constraints
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
Cost-Constrained minimum-delay multicasting
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Approximation algorithms and hardness results for labeled connectivity problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Computing mobile agent routes with node-wise constraints in distributed communication systems
MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem
Operations Research Letters
Three-dimensional Route Planning for Unmanned Aerial Vehicles in a Risk Environment
Journal of Intelligent and Robotic Systems
Best upgrade plans for large road networks
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
| Hi-index | 0.01 |
In this short paper we give a very simple fully polynomial approximation scheme for the restricted shortest path problem. The complexity of this @e-approximation scheme is O(|E|n(loglogn+1/@e)), which improves Hassin's original result (Math. Oper. Res. 17 (1) (1992) 36) by a factor of n. Furthermore, this complexity bound is valid for any graph, regardless of the cost values. This generalizes Hassin's results which apply only to acyclic graphs. Our algorithm is based on Hassin's original result with two improvements. First we modify Hassin's result and achieve time complexity of O(|E|n(loglog(UB/LB)+1/@e)), where UB and LB are upper and lower bounds for the problem. This modified version can be applied to general graphs with any cost values. Then we combine it with our second contribution, which shows how to find an upper and a lower bound such that UB/LB=