Online Predictions for Online TSP on the Line

DOI10.1142/s0129054123470020OpenAlexW4385272362MaRDI QIDQ6066466

Ya-Chun Liang, Unnamed Author, Chung-Shou Liao

Publication date: 16 November 2023

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054123470020

zbMATH Keywords

competitive analysistraveling salesman problemonline algorithmmachine learning predictions

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Mathematical programming (90Cxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Heuristics for semirandom graph problems
• The Online TSP Against Fair Adversaries
• Coloring Random and Semi-Random k-Colorable Graphs
• Finding and certifying a large hidden clique in a semirandom graph
• Algorithms with Predictions
• Tight Bounds for Online TSP on the Line
• Online Scheduling via Learned Weights
• Scheduling with Predictions and the Price of Misprediction
• Algorithms for the on-line travelling salesman

This page was built for publication: Online Predictions for Online TSP on the Line