Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrierand 
Derandomization

Henzinger, Monika; Krinninger, Sebastian; Nanongkai, Danupon

doi:10.1137/140957299

Item

ITEM ACTIONSEXPORT

DownloadE-Mail

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_2388192_2

DetailsSummary

Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrierand Derandomization

Henzinger, M., Krinninger, S., & Nanongkai, D. (2016). Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrierand Derandomization. SIAM Journal on Scientific Computing, 45(3), 947-1006. doi:10.1137/140957299.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-002C-52D7-4 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-002C-52D8-2

Genre: Journal Article

Latex : Dynamic Approximate All-Pairs Shortest Paths: Breaking the {O(mn)} Barrierand Derandomization

Files

show Files

Locators

show

Creators

show

hide

Creators:
Henzinger, Monika¹, Author
Krinninger, Sebastian¹, Author
Nanongkai, Danupon¹, Author

Affiliations:
1External Organizations, ou_persistent22

Content

show

Details

show

hide

Language(s): eng - English

Dates: Published Online: 2016Date issued: 2016

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: DOI: 10.1137/140957299
BibTex Citekey: HenzingerKN2016

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: SIAM Journal on Scientific Computing

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Philadelphia, PA : SIAM

Pages: - Volume / Issue: 45 (3) Sequence Number: - Start / End Page: 947 - 1006 Identifier: ISSN: 1064-8275
CoNE: https://pure.mpg.de/cone/journals/resource/954928546248