License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-97254
URL: http://drops.dagstuhl.de/opus/volltexte/2018/9725/
Go to the corresponding LIPIcs Volume Portal


Blais, Eric ; Jansen, Klaus ; Rolim, Josť D. P. ; Steurer, David

LIPIcs, Volume 116, APPROX/RANDOM'18, Complete Volume

pdf-format:
lipics_vol116_approx_random2018_complete.pdf (31 MB)


Abstract

LIPIcs, Volume 116, APPROX/RANDOM'18, Complete Volume

BibTeX - Entry

@InProceedings{blais_et_al:LIPIcs:2018:9725,
  author =	{Eric Blais and Klaus Jansen and Jos{\'e} D. P. Rolim and David Steurer},
  title =	{{LIPIcs, Volume 116, APPROX/RANDOM'18, Complete Volume}},
  booktitle =	{Approximation, Randomization, and Combinatorial  Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-085-9},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{116},
  editor =	{Eric Blais and Klaus Jansen and Jos{\'e} D. P. Rolim and David Steurer},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/9725},
  URN =		{urn:nbn:de:0030-drops-97254},
  annote =	{Keywords: Mathematics of computing, Theory of computation}
}

Keywords: Mathematics of computing, Theory of computation
Seminar: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)
Issue Date: 2018
Date of publication: 28.08.2018


DROPS-Home | Imprint | Privacy Published by LZI