Improved Bounds for Shortest Paths in Dense Distance Graphs

Article Details
Title:	Improved Bounds for Shortest Paths in Dense Distance Graphs
Article URLs:	https://doi.org/10.4230/LIPIcs.ICALP.2018.61
Alternative Article URLs:
Authors:	Pawel Gawrychowski	University of Wrocław, Institute of Computer Science
Authors:	Adam Karczmarz	University of Warsaw
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:	https://arxiv.org/abs/1602.07013
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/icalp/GawrychowskiK18
Author Comments:

Intl. Colloquium on Automata, Languages, and Programming, ICALP 2018