2026-07-23T00:18:18Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2160 2024-03-06T11:08:48Z ddc:004 open_access

A Robust PTAS for the Parallel Machine Covering Problem Skutella, Martin Verschae, Jose Stability approximation schemes online algorithms In general, combinatorial optimization problems are unstable: slight changes on the instance of a problem can render huge changes in the optimal solution. Thus, a natural question arises: Can we achieve stability if we only maintain approximate solutions?. In this talk I will first formalize these ideas, and then show some results on the parallel machine covering problem. In particular I will derive a robust PTAS, i.e., I will show how to construct a solution that is not only $(1-epsilon)$-approximate, but is also stable. That is, if the instance is changed by adding or removing a job, then we can construct a new near-optimal solution by only slightly modifying the previous one. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Martin Skutella and Jose Verschae 2009 Is Part Of Dagstuhl Seminar Proceedings, Volume 9261, Models and Algorithms for Optimization in Logistics (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.09261.4 urn:nbn:de:0030-drops-21609 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.4 eng https://creativecommons.org/licenses/by/4.0/legalcode