2026-07-22T22:17:55Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:12461 2024-03-06T10:50:12Z ddc:004 open_access

Robust Algorithms for TSP and Steiner Tree Ganesh, Arun Maggs, Bruce M. Panigrahi, Debmalya Robust optimization Steiner tree traveling salesman problem Robust optimization is a widely studied area in operations research, where the algorithm takes as input a range of values and outputs a single solution that performs well for the entire range. Specifically, a robust algorithm aims to minimize regret, defined as the maximum difference between the solution’s cost and that of an optimal solution in hindsight once the input has been realized. For graph problems in P, such as shortest path and minimum spanning tree, robust polynomial-time algorithms that obtain a constant approximation on regret are known. In this paper, we study robust algorithms for minimizing regret in NP-hard graph optimization problems, and give constant approximations on regret for the classical traveling salesman and Steiner tree problems. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Arun Ganesh and Bruce M. Maggs and Debmalya Panigrahi 2020 Is Part Of LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICALP.2020.54 urn:nbn:de:0030-drops-124619 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.54 eng https://creativecommons.org/licenses/by/3.0/legalcode