de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

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

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons199379

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

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
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: http://hdl.handle.net/11858/00-001M-0000-002C-52C0-5
Abstract
There is no abstract available