Elastic-Degenerate String Matching with 1 Error

Abstract

General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal Take down policyIf you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

Learning-Augmented Algorithms for Online TSP on the Line

“…Independent Work. Compared to the problem considered in this paper, a more general one, the online metric TSP, as well as a more restricted version in the half-line, have been studied in (Bernardini et al 2022) under a different setting, concurrently to our work. We note that only the closed variant is considered in (Bernardini et al 2022).…”

“…Compared to the problem considered in this paper, a more general one, the online metric TSP, as well as a more restricted version in the half-line, have been studied in (Bernardini et al 2022) under a different setting, concurrently to our work. We note that only the closed variant is considered in (Bernardini et al 2022). Since the prediction model is different (predictions for the positions as well as release times of the requests are given) and a different error definition is used, the results are incomparable.…”