An improved FPTAS for restricted shortest path

Information Processing Letters

Volumn 83, Issue 5, 2002, Pages 287-291

  Ergun, Funda ^a   Sinha, Rakesh ^b   Zhang, Lisa ^c  

^a CASE WESTERN RESERVE UNIVERSITY   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

Acyclic graphs; Approximation algorithms; Combinatorial problems; Shortest path

Indexed keywords

ADAPTIVE ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; ITERATIVE METHODS; POLYNOMIAL APPROXIMATION; QUALITY OF SERVICE; ROUTERS;

ACYCLIC GRAPHS; RESTRICTED SHORTEST PATH PROBLEM (RSP);

GRAPH THEORY;

EID: 0037105930     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00205-3     Document Type: Article

References (7)

1. Efficient computation of delay-sensitive routes from one source to all destinations
2. Approximation schemes for the restricted shortest path problems
3. The network inhibition problem
4. Algorithms for scheduling independent tasks
5. Approximation of Pareto optima in multiple-objective, shortest path problems