English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths

MPS-Authors
/persons/resource/persons199379

Krinninger,  Sebastian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
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

Henzinger, M., Krinninger, S., & Nanongkai, D. (2016). A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths. In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing (pp. 489-498). New York, NY: ACM. doi:10.1145/2897518.2897638.


Cite as: https://hdl.handle.net/11858/00-001M-0000-002C-52C0-5
Abstract
There is no abstract available