License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-21609
URL: http://drops.dagstuhl.de/opus/volltexte/2009/2160/
Go to the corresponding Portal


Skutella, Martin ; Verschae, Jose

A Robust PTAS for the Parallel Machine Covering Problem

pdf-format:
Document 1.pdf (119 KB)


Abstract

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

@InProceedings{skutella_et_al:DSP:2009:2160,
  author =	{Martin Skutella and Jose Verschae},
  title =	{A Robust PTAS for the Parallel Machine Covering Problem},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  year =	{2009},
  editor =	{Cynthia Barnhart and Uwe Clausen and Ulrich Lauther and Rolf H. M{\"o}hring},
  number =	{09261},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2160},
  annote =	{Keywords: Stability, approximation schemes, online algorithms}
}

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


DROPS-Home | Fulltext Search | Imprint Published by LZI