{"date_updated":"2022-01-06T06:52:30Z","citation":{"bibtex":"@inproceedings{Augustine_Hinnenthal_Kuhn_Scheideler_Schneider_2019, place={Philadelphia, PA}, title={Shortest Paths in a Hybrid Network Model}, DOI={<a href=\"https://doi.org/10.1137/1.9781611975994.78\">10.1137/1.9781611975994.78</a>}, booktitle={Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms}, author={Augustine, John and Hinnenthal, Kristian and Kuhn, Fabian and Scheideler, Christian and Schneider, Philipp}, year={2019}, pages={1280–1299} }","ieee":"J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, and P. Schneider, “Shortest Paths in a Hybrid Network Model,” in <i>Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2019, pp. 1280–1299.","chicago":"Augustine, John, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, and Philipp Schneider. “Shortest Paths in a Hybrid Network Model.” In <i>Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 1280–99. Philadelphia, PA, 2019. <a href=\"https://doi.org/10.1137/1.9781611975994.78\">https://doi.org/10.1137/1.9781611975994.78</a>.","short":"J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, 2019, pp. 1280–1299.","ama":"Augustine J, Hinnenthal K, Kuhn F, Scheideler C, Schneider P. Shortest Paths in a Hybrid Network Model. In: <i>Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i>. Philadelphia, PA; 2019:1280-1299. doi:<a href=\"https://doi.org/10.1137/1.9781611975994.78\">10.1137/1.9781611975994.78</a>","mla":"Augustine, John, et al. “Shortest Paths in a Hybrid Network Model.” <i>Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i>, 2019, pp. 1280–99, doi:<a href=\"https://doi.org/10.1137/1.9781611975994.78\">10.1137/1.9781611975994.78</a>.","apa":"Augustine, J., Hinnenthal, K., Kuhn, F., Scheideler, C., &#38; Schneider, P. (2019). Shortest Paths in a Hybrid Network Model. In <i>Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms</i> (pp. 1280–1299). Philadelphia, PA. <a href=\"https://doi.org/10.1137/1.9781611975994.78\">https://doi.org/10.1137/1.9781611975994.78</a>"},"language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"title":"Shortest Paths in a Hybrid Network Model","publication_identifier":{"isbn":["9781611975994"]},"year":"2019","page":"1280-1299","_id":"15627","status":"public","type":"conference","place":"Philadelphia, PA","author":[{"first_name":"John","full_name":"Augustine, John","last_name":"Augustine"},{"last_name":"Hinnenthal","id":"32229","first_name":"Kristian","full_name":"Hinnenthal, Kristian"},{"full_name":"Kuhn, Fabian","first_name":"Fabian","last_name":"Kuhn"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"last_name":"Schneider","first_name":"Philipp","full_name":"Schneider, Philipp"}],"date_created":"2020-01-22T09:07:36Z","publication":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms","publication_status":"published","user_id":"32229","doi":"10.1137/1.9781611975994.78"}