License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09261.4
URN: urn:nbn:de:0030-drops-21609
Go to the corresponding Portal

Skutella, Martin ; Verschae, Jose

A Robust PTAS for the Parallel Machine Covering Problem

09261.VerschaeJose.ExtAbstract.2160.pdf (0.1 MB)


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.

BibTeX - Entry

  author =	{Skutella, Martin and Verschae, Jose},
  title =	{{A Robust PTAS for the Parallel Machine Covering Problem}},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  pages =	{1--3},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9261},
  editor =	{Cynthia Barnhart and Uwe Clausen and Ulrich Lauther and Rolf H. M\"{o}hring},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-21609},
  doi =		{10.4230/DagSemProc.09261.4},
  annote =	{Keywords: Stability, approximation schemes, online algorithms}

Keywords: Stability, approximation schemes, online algorithms
Collection: 09261 - Models and Algorithms for Optimization in Logistics
Issue Date: 2009
Date of publication: 02.10.2009

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI