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
Algorithms for Scheduling Independent Tasks
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Algorithms for computing QoS paths with restoration
IEEE/ACM Transactions on Networking (TON)
Efficiently computing succinct trade-off curves
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
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
Polynomial time approximation algorithms for multi-constrained QoS routing
IEEE/ACM Transactions on Networking (TON)
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
Routing connections with differentiated reliability requirements in WDM mesh networks
IEEE/ACM Transactions on Networking (TON)
A faster approximation scheme for timing driven minimum cost layer assignment
Proceedings of the 2009 international symposium on Physical design
International Journal of Applied Mathematics and Computer Science
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
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
SIAM Journal on Computing
Approximation scheme for restricted discrete gate sizing targeting delay minimization
Journal of Combinatorial Optimization
QoS routing algorithms using fully polynomial time approximation scheme
Proceedings of the Nineteenth International Workshop on Quality of Service
A binary graph reduction algorithm for multi-constrained QoS routing
Proceedings of the Second Asia-Pacific Symposium on Internetware
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
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
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
Finding the minimum-weight k-path
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
The subdivision-constrained routing requests problem
Journal of Combinatorial Optimization
| Hi-index | 0.90 |
Given a graph with a cost and a delay on each edge, Restricted Shortest Path (RSP) aims to find a min-cost s-t path subject to an end-to-end delay constraint. The problem is NP-hard. In this note we present an FPTAS with an improved running time of O(mn/ε) for acyclic graphs, where m and n denote the number of edges and nodes in the graph. Our algorithm uses a scaling and rounding technique similar to that of Hassin [Math. Oper. Res. 17 (1) (1992) 36-42]. The novelty of our algorithm lies in its "adaptivity". During each iteration of our algorithm the approximation parameters are fine-tuned according to the quality of the current solution so that the running time is kept low while progress is guaranteed at each iteration. Our result improves those of Hassin [Math. Open Res. 17 (1) (1992) 36-42], Phillips [Proc. 25th Annual ACM Symposium on the Theory of Computing, 1993, pp. 776-785], and Raz and Lorenz [Technical Report, 1999].