DagRep.1.2.67.pdf
- Filesize: 0.99 MB
- 27 pages
Document
Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 1, Issue 2
Volume: Dagstuhl Reports, Volume 1
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2011-07-05
Cite As Get BibTex
Klaus Jansen, Claire Matieu, Hadas Shachnai, and Neal E. Young. Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091). In Dagstuhl Reports, Volume 1, Issue 2, pp. 67-93, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/DagRep.1.2.67
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.
Subject Classification
Keywords
- Packing
- scheduling
- information and communication services
- combinatorial optimization
- mathematical programming
- parameterized complexity
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads