Citation
Formulations, Relaxations, Approximations and Gaps in the World of Scheduling. In Selected papers from the 1st Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), pages 19-36, Springer, 2005.
Selected
Abstract
We discuss a number of polynomial time approximation results for scheduling problems. All presented results are based on the technique of rounding the optimal solution of an underlying linear programming relaxation. We analyse these relaxations, their integrality gaps, and the resulting approximation algorithms, and we derive matching worst-case instances.
There is no pdf available for this paper. You might like to try to obtain the original source (see the doi, for example)
doi
The doi for this publication is 10.1007/0-387-27744-7_2 You can link directly to the original paper, via the doi, from here
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INBOOK{2005-019-036-SI, chapter = {Selected papers from the 1st Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA)},
pages = {19--36},
title = {Formulations, Relaxations, Approximations and Gaps in the World of Scheduling},
publisher = {Springer},
year = {2005},
editor = {G. Kendall and E. Burke and S. Petrovic and M. Gendreau},
author = {G. J. Woeginger},
note = {Selected},
abstract = {We discuss a number of polynomial time approximation results for scheduling problems. All presented results are based on the technique of rounding the optimal solution of an underlying linear programming relaxation. We analyse these relaxations, their integrality gaps, and the resulting approximation algorithms, and we derive matching worst-case instances.},
doi = {10.1007/0-387-27744-7_2},
owner = {gxk},
timestamp = {2012.05.29} }