-approximation schemes for the constrained shortest path problem

zbMATH Open1398.90198MaRDI QIDQ4635995FDOQ4635995

Authors: Krishnaiyan Thulasiraman 

Publication date: 23 April 2018

Recommendations

• A simple efficient approximation scheme for the restricted shortest path problem
• Multi-criteria approximation schemes for the resource constrained shortest path problem
• Approximation Schemes for the Restricted Shortest Path Problem
• Publication:2753949
• Lagrangian relaxation and enumeration for solving constrained shortest-path problems

zbMATH Keywords

fully polynomial time approximation algorithmHassin-Lorenz-Raz (HLR) algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation algorithms (68W25)

Cited In (1)

• A simple efficient approximation scheme for the restricted shortest path problem

This page was built for publication: \(\varepsilon\)-approximation schemes for the constrained shortest path problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635995)