2026-07-20T11:57:08Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3157 2024-03-06T10:25:40Z ddc:004 open_access

Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091) Jansen, Klaus Matieu, Claire Shachnai, Hadas Young, Neal E. Packing scheduling information and communication services combinatorial optimization mathematical programming parameterized complexity 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Klaus Jansen and Claire Matieu and Hadas Shachnai and Neal E. Young 2011 Is Part Of Dagstuhl Reports, Volume 1, Issue 2 (2011) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.1.2.67 urn:nbn:de:0030-drops-31579 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.2.67 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode