GEN-LARAC: A generalized approach to the constrained shortest path problem under multiple additive constraints

Ying Xiao, Krishnaiyan Thulasiraman, Guoliang Xue

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationAlgorithms and Computation - 16th International Symposium, ISAAC 2005, Proceedings
Pages92-105
Number of pages14
DOIs
StatePublished - Dec 1 2005
Event16th International Symposium on Algorithms and Computation, ISAAC 2005 - Hainan, China
Duration: Dec 19 2005Dec 21 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3827 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other16th International Symposium on Algorithms and Computation, ISAAC 2005
CountryChina
CityHainan
Period12/19/0512/21/05

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'GEN-LARAC: A generalized approach to the constrained shortest path problem under multiple additive constraints'. Together they form a unique fingerprint.

  • Cite this

    Xiao, Y., Thulasiraman, K., & Xue, G. (2005). GEN-LARAC: A generalized approach to the constrained shortest path problem under multiple additive constraints. In Algorithms and Computation - 16th International Symposium, ISAAC 2005, Proceedings (pp. 92-105). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3827 LNCS). https://doi.org/10.1007/11602613_11