Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082)

Beasley, LeRoy B.; Klauck, Hartmut; Lee, Troy; Theis, Dirk Oliver

doi:10.4230/DagRep.3.2.127

Document

Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082)

Authors LeRoy B. Beasley, Hartmut Klauck, Troy Lee, Dirk Oliver Theis and all authors of the abstracts in this report

Part of: Issue: Dagstuhl Reports, Volume 3, Issue 2
Part of: Volume: Dagstuhl Reports, Volume 3
Part of: Journal: Dagstuhl Reports (DagRep)
License: Creative Commons Attribution 3.0 Unported license
Publication Date: 2013-06-20

PDF

File

DagRep.3.2.127.pdf

Filesize: 0.79 MB
17 pages

Document Identifiers

DOI: 10.4230/DagRep.3.2.127
URN: urn:nbn:de:0030-drops-40191

Author Details

LeRoy B. Beasley

Hartmut Klauck

Troy Lee

Dirk Oliver Theis

and all authors of the abstracts in this report

Cite AsGet BibTex

LeRoy B. Beasley, Hartmut Klauck, Troy Lee, and Dirk Oliver Theis. Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082). In Dagstuhl Reports, Volume 3, Issue 2, pp. 127-143, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
https://doi.org/10.4230/DagRep.3.2.127

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 13082 "Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices".

Keywords

nonnegative rank
combinatorial optimization
communication complexity
extended formulation size

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail