Document Open Access Logo

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

Authors Klaus Jansen, Claire Matieu, Hadas Shachnai, Neal E. Young and all authors of the abstracts in this report



PDF
Thumbnail PDF

File

DagRep.1.2.67.pdf
  • Filesize: 0.99 MB
  • 27 pages

Document Identifiers

Author Details

Klaus Jansen
Claire Matieu
Hadas Shachnai
Neal E. Young
and all authors of the abstracts in this report

Cite AsGet 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.
Keywords
  • Packing
  • scheduling
  • information and communication services
  • combinatorial optimization
  • mathematical programming
  • parameterized complexity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail