TY - GEN

T1 - GEN-LARAC

T2 - 16th International Symposium on Algorithms and Computation, ISAAC 2005

AU - Xiao, Ying

AU - Thulasiraman, Krishnaiyan

AU - Xue, Guoliang

PY - 2005

Y1 - 2005

N2 - Given a network modeled as a graph G with each link associated with a cost and k weights, the Constrained Shortest Path (CSP(k)) problem asks for computing a minimum cost path from a source node s to a target node t satisfying pre-specified bounds on path weights: This problem is NP-hard. In this paper we propose a new approximation algorithm called GEN-LARAC for CSP(k) problem based on Lagrangian relaxation method. For k = 1, we show that the relaxed problem can be solved by a polynomial time algorithm with time complexity O((m + n log n)2). Using this algorithm as a building block and combing it with ideas from mathematical programming, we propose an efficient algorithm for arbitrary k. We, prove the convergence of our algorithm and compare it with previously known algorithms. We point out that our algorithm is also applicable to a more general class of constrained optimization problems.

AB - Given a network modeled as a graph G with each link associated with a cost and k weights, the Constrained Shortest Path (CSP(k)) problem asks for computing a minimum cost path from a source node s to a target node t satisfying pre-specified bounds on path weights: This problem is NP-hard. In this paper we propose a new approximation algorithm called GEN-LARAC for CSP(k) problem based on Lagrangian relaxation method. For k = 1, we show that the relaxed problem can be solved by a polynomial time algorithm with time complexity O((m + n log n)2). Using this algorithm as a building block and combing it with ideas from mathematical programming, we propose an efficient algorithm for arbitrary k. We, prove the convergence of our algorithm and compare it with previously known algorithms. We point out that our algorithm is also applicable to a more general class of constrained optimization problems.

UR - http://www.scopus.com/inward/record.url?scp=33744959285&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33744959285&partnerID=8YFLogxK

U2 - 10.1007/11602613_11

DO - 10.1007/11602613_11

M3 - Conference contribution

AN - SCOPUS:33744959285

SN - 3540309357

SN - 9783540309352

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 92

EP - 105

BT - Algorithms and Computation - 16th International Symposium, ISAAC 2005, Proceedings

Y2 - 19 December 2005 through 21 December 2005

ER -