Go to the corresponding LIPIcs Volume Portal 
van Ee, Martijn ; Oosterwijk, Tim ; Sitters, RenĂ© ; Wiese, Andreas
pdfformat: 

@InProceedings{vanee_et_al:LIPIcs.MFCS.2023.86, author = {van Ee, Martijn and Oosterwijk, Tim and Sitters, Ren\'{e} and Wiese, Andreas}, title = {{Exact and Approximation Algorithms for Routing a Convoy Through a Graph}}, booktitle = {48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)}, pages = {86:186:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772921}, ISSN = {18688969}, year = {2023}, volume = {272}, editor = {Leroux, J\'{e}r\^{o}me and Lombardy, Sylvain and Peleg, David}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18620}, URN = {urn:nbn:de:0030drops186205}, doi = {10.4230/LIPIcs.MFCS.2023.86}, annote = {Keywords: approximation algorithms, convoy routing, shortest path problem, traveling salesperson problem} }
Keywords:  approximation algorithms, convoy routing, shortest path problem, traveling salesperson problem  
Collection:  48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)  
Issue Date:  2023  
Date of publication:  21.08.2023 