Reinhard Bauer, Gianlorenzo D Angelo, Daniel Delling, Dorothea Wagner. The Shortcut Problem - Complexity and Approximation. In Mogens Nielsen, Antonín Kucera, Peter Bro Miltersen, Catuscia Palamidessi, Petr Tuma, Frank D. Valencia, editors, SOFSEM 2009: Theory and Practice of Computer Science, 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings. Volume 5404 of Lecture Notes in Computer Science, pages 105-116, Springer, 2009. [doi]
@inproceedings{BauerDDW09,
title = {The Shortcut Problem - Complexity and Approximation},
author = {Reinhard Bauer and Gianlorenzo D Angelo and Daniel Delling and Dorothea Wagner},
year = {2009},
doi = {10.1007/978-3-540-95891-8_13},
url = {http://dx.doi.org/10.1007/978-3-540-95891-8_13},
researchr = {https://researchr.org/publication/BauerDDW09},
cites = {0},
citedby = {0},
pages = {105-116},
booktitle = {SOFSEM 2009: Theory and Practice of Computer Science, 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings},
editor = {Mogens Nielsen and Antonín Kucera and Peter Bro Miltersen and Catuscia Palamidessi and Petr Tuma and Frank D. Valencia},
volume = {5404},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-95890-1},
}