License
when quoting this document, please refer to the following
DOI: 10.4230/DagRep.1.2.67
URN: urn:nbn:de:0030-drops-31579
URL: http://drops.dagstuhl.de/opus/volltexte/2011/3157/

Jansen, Klaus ; Matieu, Claire ; Shachnai, Hadas ; Young, Neal E.
Weitere Beteiligte (Hrsg. etc.): Klaus Jansen and Claire Mathieu and Hadas Shachnai and Neal E. Young

Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091)

pdf-format:
Dokument 1.pdf (1,021 KB)


Abstract

From 27.02.2011 to 4.03.2011, the Dagstuhl Seminar 11091 ``Packing and Scheduling Algorithms for Information and Communication Services'' was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and on-going work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

BibTeX - Entry

@Article{jansen_et_al:DR:2011:3157,
  author =	{Klaus Jansen and Claire Matieu and Hadas Shachnai and Neal E. Young},
  title =	{{Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091)}},
  pages =	{67--93},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{2},
  editor =	{Klaus Jansen and Claire Mathieu and Hadas Shachnai and Neal E. Young},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3157},
  URN =		{urn:nbn:de:0030-drops-31579},
  doi =		{http://dx.doi.org/10.4230/DagRep.1.2.67},
  annote =	{Keywords: Packing, scheduling, information and communication services, combinatorial optimization, mathematical programming, parameterized complexity}
}

Keywords: Packing, scheduling, information and communication services, combinatorial optimization, mathematical programming, parameterized complexity
Seminar: Dagstuhl Reports, Volume 1, Issue 2
Issue date: 2011
Date of publication: 05.07.2011


DROPS-Home | Fulltext Search | Imprint Published by LZI