@Article{beasley_et_al:DagRep.3.2.127,
  author =	{Beasley, LeRoy B. and Klauck, Hartmut and Lee, Troy and Theis, Dirk Oliver},
  title =	{{Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082)}},
  pages =	{127--143},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2013},
  volume =	{3},
  number =	{2},
  editor =	{Beasley, LeRoy B. and Klauck, Hartmut and Lee, Troy and Theis, Dirk Oliver},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.3.2.127},
  URN =		{urn:nbn:de:0030-drops-40191},
  doi =		{10.4230/DagRep.3.2.127},
  annote =	{Keywords: nonnegative rank, combinatorial optimization, communication complexity, extended formulation size}
}