%0 Journal Article %1 rupp2021lower %A Rupp, Tobias %A Funke, Stefan %D 2021 %I MDPI %J Algorithms %K oa ubs_10005 ubs_20008 ubs_30080 ubs_40106 unibibliografie wos %N 6 %P 164 %R 10.3390/a14060164 %T A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels and a Provably Optimal Instance-Based Schema %V 14

@article{rupp2021lower, added-at = {2022-04-14T15:19:46.000+0200}, affiliation = {Rupp, T (Corresponding Author), Univ Stuttgart, Inst Formale Methoden Informat, D-70174 Stuttgart, Germany. Rupp, Tobias; Funke, Stefan, Univ Stuttgart, Inst Formale Methoden Informat, D-70174 Stuttgart, Germany.}, author = {Rupp, Tobias and Funke, Stefan}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2d6a006d09350ac787768463c0e6388ff/unibiblio}, doi = {10.3390/a14060164}, interhash = {67fd72ee006086a6006f9cc2418b13de}, intrahash = {d6a006d09350ac787768463c0e6388ff}, issn = {1999-4893}, journal = {Algorithms}, keywords = {oa ubs_10005 ubs_20008 ubs_30080 ubs_40106 unibibliografie wos}, language = {eng}, number = 6, pages = 164, publisher = {MDPI}, research-areas = {Computer Science}, timestamp = {2022-04-14T13:19:46.000+0200}, title = {A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels and a Provably Optimal Instance-Based Schema}, unique-id = {ISI:000665416600001}, volume = 14, year = 2021 }