@inproceedings{d16d898e516b43ec97c51099728f41db,
title = "On shortest path problems with “non-markovian” link contribution to path lengths",
abstract = "In this paper we introduce a new class of shortest path problems, where the contribution of a link to the path length computation depends not only on the weight of that link but also on the weights of the links already traversed. This class of problems may be viewed as {"}non-Markovian{"}. We consider a specific problem that belong to this class, which is encountered in the multimedia data transmission domain. We consider this problem under different conditions and develop algorithms. The shortest path problem in multimedia data transmission environment can be solved in O(n2) or O(n3) computational time.",
author = "Arunabha Sen and Kasim Candan and Afonso Ferreira and Bruno Beauquier and Stephane Perennes",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; IFIP-TC6/European Commission International Conference on Networking, NETWORKING 2000 ; Conference date: 14-05-2000 Through 19-05-2000",
year = "2000",
doi = "10.1007/3-540-45551-5\_72",
language = "English (US)",
isbn = "354067506X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "859--870",
editor = "Guy Pujolle and Harry Perros and Serge Fdida and Ulf Korner and Ioannis Stavrakakis",
booktitle = "NETWORKING 2000",
}