@InProceedings{duan_et_al:LIPIcs.ICALP.2018.42,
author = {Duan, Ran and Ren, Hanlin},
title = {{Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {42:1--42:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-076-7},
ISSN = {1868-8969},
year = {2018},
volume = {107},
editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.42},
URN = {urn:nbn:de:0030-drops-90467},
doi = {10.4230/LIPIcs.ICALP.2018.42},
annote = {Keywords: Graph Theory, Approximation Algorithms, Combinatorial Optimization}
}