Two techniques for fast computation of constrained shortest paths

Shigang Chen, Meongchul Song, Sartaj Sahni. Two techniques for fast computation of constrained shortest paths. In Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November - 3 December 2004. pages 1348-1352, IEEE, 2004. [doi]

@inproceedings{ChenSS04-0,
  title = {Two techniques for fast computation of constrained shortest paths},
  author = {Shigang Chen and Meongchul Song and Sartaj Sahni},
  year = {2004},
  doi = {10.1109/GLOCOM.2004.1378205},
  url = {http://dx.doi.org/10.1109/GLOCOM.2004.1378205},
  researchr = {https://researchr.org/publication/ChenSS04-0},
  cites = {0},
  citedby = {0},
  pages = {1348-1352},
  booktitle = {Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November - 3 December 2004},
  publisher = {IEEE},
  isbn = {0-7803-8794-5},
}