A simple efficient approximation scheme for the restricted shortest path problem

Operations Research Letters

Volumn 28, Issue 5, 2001, Pages 213-219

  Lorenz, Dean H ^a   Raz, Danny ^a,b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; THEOREM PROVING;

HASSIN THEORY;

OPERATIONS RESEARCH;

EID: 0035364530     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(01)00069-4     Document Type: Article

References (6)

1. Approximation schemes for the restricted shortest path problem
2. QoS routing on networks with uncertain parameters
3. Errata and comments on "approximation algorithms for the capacitated plant allocation problem"
4. The network inhibition problem
5. Optimal partition of QoS requirements with discrete cost functions
6. Approximation of pareto optima in multiple-objective shortest path problems