On-line and Dynamic Algorithms for Shortest Path Problems

Djidjev, Hristo N.; Pantziou, Grammati E.; Zaroliagis, Christos

doi:10.1007/3-540-59042-0_73

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

On-line and Dynamic Algorithms for Shortest Path Problems

MPS-Authors

/persons/resource/persons45787

Zaroliagis, Christos
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/dubfp
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Djidjev, H. N., Pantziou, G. E., & Zaroliagis, C. (1995). On-line and Dynamic Algorithms for Shortest Path Problems. In E. W. Mayr, & C. Puech (Eds.), STACS 95 (pp. 193-204). Berlin: Springer.

Cite as: https://hdl.handle.net/21.11116/0000-000E-13D3-E

Abstract

There is no abstract available