Published in: LIPIcs, Volume 81, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)
Alan Frieze and Wesley Pegden. Traveling in Randomly Embedded Random Graphs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 81, pp. 45:1-45:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{frieze_et_al:LIPIcs.APPROX-RANDOM.2017.45,
author = {Frieze, Alan and Pegden, Wesley},
title = {{Traveling in Randomly Embedded Random Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)},
pages = {45:1--45:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-044-6},
ISSN = {1868-8969},
year = {2017},
volume = {81},
editor = {Jansen, Klaus and Rolim, Jos\'{e} D. P. and Williamson, David P. and Vempala, Santosh S.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2017.45},
URN = {urn:nbn:de:0030-drops-75949},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2017.45},
annote = {Keywords: Traveling Salesman, Euclidean, Shortest Path}
}
Feedback for Dagstuhl Publishing